./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0_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_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59acfc6d5178664a3f2144603274c2b6e876292a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:52:07,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:52:07,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:52:07,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:52:07,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:52:07,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:52:07,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:52:07,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:52:07,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:52:07,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:52:07,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:52:07,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:52:07,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:52:07,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:52:07,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:52:07,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:52:07,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:52:07,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:52:07,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:52:07,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:52:07,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:52:07,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:52:07,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:52:07,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:52:07,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:52:07,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:52:07,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:52:07,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:52:07,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:52:07,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:52:07,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:52:07,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:52:07,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:52:07,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:52:07,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:52:07,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:52:07,438 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 09:52:07,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:52:07,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:52:07,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:52:07,449 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 09:52:07,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:52:07,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:52:07,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:52:07,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:52:07,451 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 09:52:07,452 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 09:52:07,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:52:07,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:52:07,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 09:52:07,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:52:07,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:52:07,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:52:07,453 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 09:52:07,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:52:07,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:52:07,453 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_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59acfc6d5178664a3f2144603274c2b6e876292a [2018-11-23 09:52:07,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:52:07,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:52:07,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:52:07,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:52:07,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:52:07,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-11-23 09:52:07,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/data/57628a196/f19ac7ab7cfb4c268a91c2754996ddf6/FLAGaa9c8b020 [2018-11-23 09:52:07,830 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:52:07,830 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-11-23 09:52:07,833 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/data/57628a196/f19ac7ab7cfb4c268a91c2754996ddf6/FLAGaa9c8b020 [2018-11-23 09:52:07,843 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/data/57628a196/f19ac7ab7cfb4c268a91c2754996ddf6 [2018-11-23 09:52:07,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:52:07,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:52:07,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:52:07,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:52:07,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:52:07,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:52:07" (1/1) ... [2018-11-23 09:52:07,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4044db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:07, skipping insertion in model container [2018-11-23 09:52:07,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:52:07" (1/1) ... [2018-11-23 09:52:07,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:52:07,873 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:52:08,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:52:08,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:52:08,015 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:52:08,027 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:52:08,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08 WrapperNode [2018-11-23 09:52:08,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:52:08,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:52:08,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:52:08,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:52:08,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:52:08,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:52:08,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:52:08,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:52:08,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:52:08,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:52:08,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:52:08,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:52:08,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:52:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 09:52:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:52:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:52:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 09:52:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 09:52:08,228 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:52:08,229 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:52:08,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:52:08 BoogieIcfgContainer [2018-11-23 09:52:08,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:52:08,229 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 09:52:08,229 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 09:52:08,236 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 09:52:08,236 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:52:08" (1/1) ... [2018-11-23 09:52:08,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:52:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 09:52:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 09:52:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 09:52:08,273 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:08,372 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 09:52:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 18 transitions. [2018-11-23 09:52:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 09:52:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:52:08,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:52:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 23 transitions. [2018-11-23 09:52:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 09:52:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:52:08,622 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 09:52:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 22 states and 29 transitions. [2018-11-23 09:52:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-11-23 09:52:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:52:08,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 09:52:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 25 states and 36 transitions. [2018-11-23 09:52:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2018-11-23 09:52:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:52:08,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 09:52:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 28 states and 44 transitions. [2018-11-23 09:52:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2018-11-23 09:52:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 09:52:09,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 09:52:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 31 states and 53 transitions. [2018-11-23 09:52:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2018-11-23 09:52:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 09:52:09,177 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 09:52:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 34 states and 63 transitions. [2018-11-23 09:52:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. [2018-11-23 09:52:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 09:52:09,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 09:52:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 37 states and 74 transitions. [2018-11-23 09:52:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2018-11-23 09:52:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 09:52:09,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 09:52:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 40 states and 86 transitions. [2018-11-23 09:52:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 86 transitions. [2018-11-23 09:52:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 09:52:09,683 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 09:52:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 43 states and 99 transitions. [2018-11-23 09:52:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 99 transitions. [2018-11-23 09:52:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 09:52:09,862 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 09:52:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 46 states and 113 transitions. [2018-11-23 09:52:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2018-11-23 09:52:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 09:52:10,044 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 09:52:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 49 states and 128 transitions. [2018-11-23 09:52:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 128 transitions. [2018-11-23 09:52:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 09:52:10,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 09:52:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 52 states and 144 transitions. [2018-11-23 09:52:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 144 transitions. [2018-11-23 09:52:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 09:52:10,435 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 09:52:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 55 states and 161 transitions. [2018-11-23 09:52:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 161 transitions. [2018-11-23 09:52:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 09:52:10,646 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 09:52:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 58 states and 179 transitions. [2018-11-23 09:52:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 179 transitions. [2018-11-23 09:52:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 09:52:10,870 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 09:52:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 61 states and 198 transitions. [2018-11-23 09:52:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 198 transitions. [2018-11-23 09:52:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 09:52:11,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 09:52:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 64 states and 218 transitions. [2018-11-23 09:52:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 218 transitions. [2018-11-23 09:52:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 09:52:11,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 09:52:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 67 states and 239 transitions. [2018-11-23 09:52:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 239 transitions. [2018-11-23 09:52:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 09:52:11,485 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 09:52:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 70 states and 261 transitions. [2018-11-23 09:52:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 261 transitions. [2018-11-23 09:52:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 09:52:11,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 09:52:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 73 states and 284 transitions. [2018-11-23 09:52:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 284 transitions. [2018-11-23 09:52:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 09:52:11,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-23 09:52:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 76 states and 308 transitions. [2018-11-23 09:52:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 308 transitions. [2018-11-23 09:52:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 09:52:12,176 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-23 09:52:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 79 states and 333 transitions. [2018-11-23 09:52:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 333 transitions. [2018-11-23 09:52:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 09:52:12,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-23 09:52:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 82 states and 359 transitions. [2018-11-23 09:52:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 359 transitions. [2018-11-23 09:52:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 09:52:12,734 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-11-23 09:52:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 85 states and 386 transitions. [2018-11-23 09:52:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 386 transitions. [2018-11-23 09:52:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 09:52:12,993 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:52:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-23 09:52:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:52:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 88 states and 414 transitions. [2018-11-23 09:52:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 414 transitions. [2018-11-23 09:52:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 09:52:13,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:52:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:52:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:52:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:52:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:52:13,497 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 26 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 25;main_~b~0 := 0; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0] [?] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=25] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=24] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=23] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=22] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=21] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=20] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=19] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=18] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=17] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=16] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=16, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=17, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=18, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=19, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=20, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=21, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=22, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=23, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=24, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=25, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0, |sum_#res|=25] [?] assume true; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#res|=25] [?] assume true; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#res|=25] [?] assume true; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#res|=25] [?] assume true; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#res|=25] [?] assume true; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#res|=25] [?] assume true; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#res|=25] [?] assume true; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#res|=25] [?] assume true; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#res|=25] [?] assume true; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#res|=25] [?] assume true; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#res|=25] [?] assume true; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#res|=25] [?] assume true; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#res|=25] [?] assume true; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#res|=25] [?] assume true; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#res|=25] [?] assume true; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#res|=25] [?] assume true; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#res|=25] [?] assume true; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#res|=25] [?] assume true; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#res|=25] [?] assume true; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#res|=25] [?] assume true; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#res|=25] [?] assume true; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#res|=25] [?] assume true; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#res|=25] [?] assume true; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#res|=25] [?] assume true; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#res|=25] [?] assume true; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#res|=25] [?] assume true; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#res|=25] [?] RET #24#return; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, |ULTIMATE.start_main_#t~ret1|=25] [?] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] assume !false; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L3-L9] ensures true; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L3-L9] ensures true; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L3-L9] ensures true; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L3-L9] ensures true; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L3-L9] ensures true; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L3-L9] ensures true; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L3-L9] ensures true; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L3-L9] ensures true; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L3-L9] ensures true; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L3-L9] ensures true; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L3-L9] ensures true; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L3-L9] ensures true; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L3-L9] ensures true; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L3-L9] ensures true; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L3-L9] ensures true; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L3-L9] ensures true; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L3-L9] ensures true; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L3-L9] ensures true; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L3-L9] ensures true; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L3-L9] ensures true; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L3-L9] ensures true; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L3-L9] ensures true; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L3-L9] ensures true; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L3-L9] ensures true; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L3-L9] ensures true; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L3-L9] ensures true; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15-L17] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L3-L9] ensures true; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L3-L9] ensures true; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L3-L9] ensures true; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L3-L9] ensures true; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L3-L9] ensures true; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L3-L9] ensures true; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L3-L9] ensures true; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L3-L9] ensures true; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L3-L9] ensures true; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L3-L9] ensures true; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L3-L9] ensures true; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L3-L9] ensures true; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L3-L9] ensures true; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L3-L9] ensures true; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L3-L9] ensures true; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L3-L9] ensures true; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L3-L9] ensures true; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L3-L9] ensures true; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L3-L9] ensures true; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L3-L9] ensures true; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L3-L9] ensures true; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L3-L9] ensures true; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L3-L9] ensures true; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L3-L9] ensures true; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L3-L9] ensures true; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L3-L9] ensures true; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15-L17] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15] COND TRUE main_~result~0 == main_~a~0 + main_~b~0 VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15] COND TRUE main_~result~0 == main_~a~0 + main_~b~0 VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L12] ~a~0 := 25; [L13] ~b~0 := 0; [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 [L16] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] ~a~0 := 25; [L13] ~b~0 := 0; [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 [L16] assert false; [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() ----- [2018-11-23 09:52:13,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 09:52:13 ImpRootNode [2018-11-23 09:52:13,764 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 09:52:13,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:52:13,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:52:13,764 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:52:13,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:52:08" (3/4) ... [2018-11-23 09:52:13,766 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 25;main_~b~0 := 0; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0] [?] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=25] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=24] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=23] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=22] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=21] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=20] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=19] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=18] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=17] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=16] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=16, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=17, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=18, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=19, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=20, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=21, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=22, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=23, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=24, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=25, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0, |sum_#res|=25] [?] assume true; VAL [sum_~m=25, sum_~n=0, |sum_#in~m|=25, |sum_#in~n|=0, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#res|=25] [?] assume true; VAL [sum_~m=24, sum_~n=1, |sum_#in~m|=24, |sum_#in~n|=1, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#res|=25] [?] assume true; VAL [sum_~m=23, sum_~n=2, |sum_#in~m|=23, |sum_#in~n|=2, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#res|=25] [?] assume true; VAL [sum_~m=22, sum_~n=3, |sum_#in~m|=22, |sum_#in~n|=3, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#res|=25] [?] assume true; VAL [sum_~m=21, sum_~n=4, |sum_#in~m|=21, |sum_#in~n|=4, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#res|=25] [?] assume true; VAL [sum_~m=20, sum_~n=5, |sum_#in~m|=20, |sum_#in~n|=5, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#res|=25] [?] assume true; VAL [sum_~m=19, sum_~n=6, |sum_#in~m|=19, |sum_#in~n|=6, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#res|=25] [?] assume true; VAL [sum_~m=18, sum_~n=7, |sum_#in~m|=18, |sum_#in~n|=7, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#res|=25] [?] assume true; VAL [sum_~m=17, sum_~n=8, |sum_#in~m|=17, |sum_#in~n|=8, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#res|=25] [?] assume true; VAL [sum_~m=16, sum_~n=9, |sum_#in~m|=16, |sum_#in~n|=9, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#res|=25] [?] assume true; VAL [sum_~m=15, sum_~n=10, |sum_#in~m|=15, |sum_#in~n|=10, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#res|=25] [?] assume true; VAL [sum_~m=14, sum_~n=11, |sum_#in~m|=14, |sum_#in~n|=11, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#res|=25] [?] assume true; VAL [sum_~m=13, sum_~n=12, |sum_#in~m|=13, |sum_#in~n|=12, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#res|=25] [?] assume true; VAL [sum_~m=12, sum_~n=13, |sum_#in~m|=12, |sum_#in~n|=13, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#res|=25] [?] assume true; VAL [sum_~m=11, sum_~n=14, |sum_#in~m|=11, |sum_#in~n|=14, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#res|=25] [?] assume true; VAL [sum_~m=10, sum_~n=15, |sum_#in~m|=10, |sum_#in~n|=15, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#res|=25] [?] assume true; VAL [sum_~m=9, sum_~n=16, |sum_#in~m|=9, |sum_#in~n|=16, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#res|=25] [?] assume true; VAL [sum_~m=8, sum_~n=17, |sum_#in~m|=8, |sum_#in~n|=17, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#res|=25] [?] assume true; VAL [sum_~m=7, sum_~n=18, |sum_#in~m|=7, |sum_#in~n|=18, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#res|=25] [?] assume true; VAL [sum_~m=6, sum_~n=19, |sum_#in~m|=6, |sum_#in~n|=19, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#res|=25] [?] assume true; VAL [sum_~m=5, sum_~n=20, |sum_#in~m|=5, |sum_#in~n|=20, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#res|=25] [?] assume true; VAL [sum_~m=4, sum_~n=21, |sum_#in~m|=4, |sum_#in~n|=21, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#res|=25] [?] assume true; VAL [sum_~m=3, sum_~n=22, |sum_#in~m|=3, |sum_#in~n|=22, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#res|=25] [?] assume true; VAL [sum_~m=2, sum_~n=23, |sum_#in~m|=2, |sum_#in~n|=23, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#res|=25] [?] assume true; VAL [sum_~m=1, sum_~n=24, |sum_#in~m|=1, |sum_#in~n|=24, |sum_#res|=25] [?] RET #26#return; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#t~ret0|=25] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#res|=25] [?] assume true; VAL [sum_~m=0, sum_~n=25, |sum_#in~m|=0, |sum_#in~n|=25, |sum_#res|=25] [?] RET #24#return; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, |ULTIMATE.start_main_#t~ret1|=25] [?] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] assume !false; VAL [ULTIMATE.start_main_~a~0=25, ULTIMATE.start_main_~b~0=0, ULTIMATE.start_main_~result~0=25] [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L3-L9] ensures true; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L3-L9] ensures true; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L3-L9] ensures true; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L3-L9] ensures true; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L3-L9] ensures true; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L3-L9] ensures true; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L3-L9] ensures true; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L3-L9] ensures true; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L3-L9] ensures true; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L3-L9] ensures true; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L3-L9] ensures true; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L3-L9] ensures true; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L3-L9] ensures true; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L3-L9] ensures true; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L3-L9] ensures true; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L3-L9] ensures true; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L3-L9] ensures true; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L3-L9] ensures true; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L3-L9] ensures true; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L3-L9] ensures true; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L3-L9] ensures true; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L3-L9] ensures true; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L3-L9] ensures true; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L3-L9] ensures true; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L3-L9] ensures true; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L3-L9] ensures true; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15-L17] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L3-L9] ensures true; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L3-L9] ensures true; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L3-L9] ensures true; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L3-L9] ensures true; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L3-L9] ensures true; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L3-L9] ensures true; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L3-L9] ensures true; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L3-L9] ensures true; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L3-L9] ensures true; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L3-L9] ensures true; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L3-L9] ensures true; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L3-L9] ensures true; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L3-L9] ensures true; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L3-L9] ensures true; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L3-L9] ensures true; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L3-L9] ensures true; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L3-L9] ensures true; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L3-L9] ensures true; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L3-L9] ensures true; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L3-L9] ensures true; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L3-L9] ensures true; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L3-L9] ensures true; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L3-L9] ensures true; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L3-L9] ensures true; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L3-L9] ensures true; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L3-L9] ensures true; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15-L17] assume main_~result~0 == main_~a~0 + main_~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15] COND TRUE main_~result~0 == main_~a~0 + main_~b~0 VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0; [L12] main_~a~0 := 25; [L13] main_~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [L14] CALL call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call main_#t~ret1 := sum(main_~a~0, main_~b~0); VAL [main_#t~ret1=25, main_~a~0=25, main_~b~0=0] [L14] assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647; [L14] main_~result~0 := main_#t~ret1; [L14] havoc main_#t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L15] COND TRUE main_~result~0 == main_~a~0 + main_~b~0 VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L16] assert false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [L12] ~a~0 := 25; [L13] ~b~0 := 0; [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 [L16] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] ~a~0 := 25; [L13] ~b~0 := 0; [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=25] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=25, ~m=0, ~n=25] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=24, ~m=1, ~n=24] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=23, ~m=2, ~n=23] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=22, ~m=3, ~n=22] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=21, ~m=4, ~n=21] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=20, ~m=5, ~n=20] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=19, ~m=6, ~n=19] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=18, ~m=7, ~n=18] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=17, ~m=8, ~n=17] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=16, ~m=9, ~n=16] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=15, ~m=10, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=14, ~m=11, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=13, ~m=12, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=12, ~m=13, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=11, ~m=14, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=15, #in~n=10, ~m=15, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=16, #in~n=9, ~m=16, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=17, #in~n=8, ~m=17, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=18, #in~n=7, ~m=18, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=19, #in~n=6, ~m=19, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=20, #in~n=5, ~m=20, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=21, #in~n=4, ~m=21, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=22, #in~n=3, ~m=22, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=23, #in~n=2, ~m=23, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=24, #in~n=1, ~m=24, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=25, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=25, #in~n=0, ~m=25, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=25, #in~n=0, #res=25, ~m=25, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=24, #in~n=1, #t~ret0=25, ~m=24, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=24, #in~n=1, #res=25, ~m=24, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=23, #in~n=2, #t~ret0=25, ~m=23, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=23, #in~n=2, #res=25, ~m=23, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=22, #in~n=3, #t~ret0=25, ~m=22, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=22, #in~n=3, #res=25, ~m=22, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=21, #in~n=4, #t~ret0=25, ~m=21, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=21, #in~n=4, #res=25, ~m=21, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=20, #in~n=5, #t~ret0=25, ~m=20, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=20, #in~n=5, #res=25, ~m=20, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=19, #in~n=6, #t~ret0=25, ~m=19, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=19, #in~n=6, #res=25, ~m=19, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=18, #in~n=7, #t~ret0=25, ~m=18, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=18, #in~n=7, #res=25, ~m=18, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=17, #in~n=8, #t~ret0=25, ~m=17, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=17, #in~n=8, #res=25, ~m=17, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=16, #in~n=9, #t~ret0=25, ~m=16, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=16, #in~n=9, #res=25, ~m=16, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=10, #t~ret0=25, ~m=15, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=15, #in~n=10, #res=25, ~m=15, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=11, #t~ret0=25, ~m=14, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=11, #res=25, ~m=14, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=12, #t~ret0=25, ~m=13, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=12, #res=25, ~m=13, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=13, #t~ret0=25, ~m=12, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=13, #res=25, ~m=12, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=14, #t~ret0=25, ~m=11, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=14, #res=25, ~m=11, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=15, #t~ret0=25, ~m=10, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=15, #res=25, ~m=10, ~n=15] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=16, #t~ret0=25, ~m=9, ~n=16] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=16, #res=25, ~m=9, ~n=16] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=17, #t~ret0=25, ~m=8, ~n=17] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=17, #res=25, ~m=8, ~n=17] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=18, #t~ret0=25, ~m=7, ~n=18] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=18, #res=25, ~m=7, ~n=18] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=19, #t~ret0=25, ~m=6, ~n=19] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=19, #res=25, ~m=6, ~n=19] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=20, #t~ret0=25, ~m=5, ~n=20] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=20, #res=25, ~m=5, ~n=20] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=21, #t~ret0=25, ~m=4, ~n=21] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=21, #res=25, ~m=4, ~n=21] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=22, #t~ret0=25, ~m=3, ~n=22] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=22, #res=25, ~m=3, ~n=22] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=23, #t~ret0=25, ~m=2, ~n=23] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=23, #res=25, ~m=2, ~n=23] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=24, #t~ret0=25, ~m=1, ~n=24] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=24, #res=25, ~m=1, ~n=24] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=25, #t~ret0=25, ~m=0, ~n=25] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=25, #res=25, ~m=0, ~n=25] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 [L16] assert false; [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() ----- [2018-11-23 09:52:14,387 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_820190b7-df40-4d86-96ce-a29715424c00/bin-2019/ukojak/witness.graphml [2018-11-23 09:52:14,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:52:14,388 INFO L168 Benchmark]: Toolchain (without parser) took 6542.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.2 MB). Free memory was 959.1 MB in the beginning and 1.4 GB in the end (delta: -395.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,389 INFO L168 Benchmark]: CDTParser took 0.15 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 09:52:14,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,395 INFO L168 Benchmark]: Boogie Preprocessor took 10.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:52:14,395 INFO L168 Benchmark]: RCFGBuilder took 164.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,395 INFO L168 Benchmark]: CodeCheck took 5534.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -212.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,396 INFO L168 Benchmark]: Witness Printer took 623.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:52:14,398 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 5.2s OverallTime, 26 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234881024 SDtfs, 218103800 SDslu, 352321520 SDs, 0 SdLazy, 1023409942 SolverSat, 184549370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37043 GetRequests, 35418 SyntacticMatches, 1523 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3683 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 540800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/15000 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 180.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 164.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 5534.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -212.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Witness Printer took 623.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...