./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_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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 15:35:49,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:35:49,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:35:49,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:35:49,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:35:49,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:35:49,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:35:49,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:35:49,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:35:49,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:35:49,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:35:49,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:35:49,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:35:49,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:35:49,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:35:49,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:35:49,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:35:49,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:35:49,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:35:49,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:35:49,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:35:49,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:35:49,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:35:49,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:35:49,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:35:49,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:35:49,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:35:49,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:35:49,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:35:49,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:35:49,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:35:49,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:35:49,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:35:49,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:35:49,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:35:49,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:35:49,890 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:35:49,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:35:49,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:35:49,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:35:49,898 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:35:49,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:35:49,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:35:49,899 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:35:49,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:35:49,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:35:49,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:35:49,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:35:49,900 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:35:49,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:35:49,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:35:49,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:35:49,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:35:49,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:35:49,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:35:49,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:35:49,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:35:49,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:35:49,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:35:49,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:35:49,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:35:49,902 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_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59acfc6d5178664a3f2144603274c2b6e876292a [2018-11-23 15:35:49,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:35:49,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:35:49,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:35:49,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:35:49,939 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:35:49,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-11-23 15:35:49,980 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/data/29eac0e7f/ca5374b79ede4ecfa4e74c8d47f52f69/FLAGf437d92d7 [2018-11-23 15:35:50,371 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:35:50,371 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-11-23 15:35:50,374 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/data/29eac0e7f/ca5374b79ede4ecfa4e74c8d47f52f69/FLAGf437d92d7 [2018-11-23 15:35:50,386 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/data/29eac0e7f/ca5374b79ede4ecfa4e74c8d47f52f69 [2018-11-23 15:35:50,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:35:50,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:35:50,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:35:50,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:35:50,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:35:50,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,396 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 03:35:50, skipping insertion in model container [2018-11-23 15:35:50,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:35:50,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:35:50,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:35:50,510 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:35:50,522 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:35:50,530 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:35:50,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50 WrapperNode [2018-11-23 15:35:50,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:35:50,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:35:50,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:35:50,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:35:50,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:35:50,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:35:50,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:35:50,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:35:50,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... [2018-11-23 15:35:50,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:35:50,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:35:50,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:35:50,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:35:50,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:35:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:35:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:35:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:35:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:35:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 15:35:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 15:35:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:35:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:35:50,734 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:35:50,734 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 15:35:50,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:50 BoogieIcfgContainer [2018-11-23 15:35:50,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:35:50,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:35:50,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:35:50,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:35:50,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:35:50" (1/3) ... [2018-11-23 15:35:50,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a13eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:35:50, skipping insertion in model container [2018-11-23 15:35:50,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:50" (2/3) ... [2018-11-23 15:35:50,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a13eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:35:50, skipping insertion in model container [2018-11-23 15:35:50,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:50" (3/3) ... [2018-11-23 15:35:50,741 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_25x0_false-unreach-call_true-termination.c [2018-11-23 15:35:50,749 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:35:50,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:35:50,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:35:50,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:35:50,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:35:50,792 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:35:50,792 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:35:50,792 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:35:50,792 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:35:50,792 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:35:50,792 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:35:50,792 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:35:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 15:35:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:35:50,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:50,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:50,814 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:50,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-23 15:35:50,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:35:50,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:35:50,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:35:50,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:35:50,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:35:50,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:35:50,997 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 15:35:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:51,068 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 15:35:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:35:51,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 15:35:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:51,078 INFO L225 Difference]: With dead ends: 30 [2018-11-23 15:35:51,078 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 15:35:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:35:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 15:35:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 15:35:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:35:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 15:35:51,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 15:35:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:51,108 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 15:35:51,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:35:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 15:35:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:35:51,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:51,109 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:51,109 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:51,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:51,110 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-23 15:35:51,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:51,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:51,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:51,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,174 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 15:35:51,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:51,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:51,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:51,233 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 15:35:51,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:51,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 15:35:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:35:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:35:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:35:51,249 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 15:35:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:51,311 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 15:35:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:35:51,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:35:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:51,312 INFO L225 Difference]: With dead ends: 25 [2018-11-23 15:35:51,312 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 15:35:51,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:35:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 15:35:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 15:35:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 15:35:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 15:35:51,317 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 15:35:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:51,317 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 15:35:51,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:35:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 15:35:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:35:51,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:51,318 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:51,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:51,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-23 15:35:51,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:51,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,383 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 15:35:51,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:51,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:51,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:35:51,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:35:51,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:51,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:51,418 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 15:35:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:51,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 15:35:51,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:35:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:35:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:35:51,437 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 15:35:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:51,487 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 15:35:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:35:51,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 15:35:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:51,488 INFO L225 Difference]: With dead ends: 28 [2018-11-23 15:35:51,489 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 15:35:51,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:35:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 15:35:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 15:35:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:35:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 15:35:51,493 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 15:35:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:51,493 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 15:35:51,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:35:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 15:35:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:35:51,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:51,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:51,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:51,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-11-23 15:35:51,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:51,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,561 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 15:35:51,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:51,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:51,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:35:51,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 15:35:51,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:51,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:51,608 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 15:35:51,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:51,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 15:35:51,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:35:51,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:35:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:35:51,626 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-23 15:35:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:51,692 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 15:35:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:35:51,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-23 15:35:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:51,693 INFO L225 Difference]: With dead ends: 31 [2018-11-23 15:35:51,693 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 15:35:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:35:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 15:35:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 15:35:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 15:35:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 15:35:51,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 15:35:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:51,698 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 15:35:51,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:35:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 15:35:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:35:51,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:51,700 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:51,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:51,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-11-23 15:35:51,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:51,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:51,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,764 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 15:35:51,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:51,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:35:51,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:35:51,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:51,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:51,805 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 15:35:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 15:35:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:35:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:35:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:35:51,830 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 15:35:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:51,898 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 15:35:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:35:51,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 15:35:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:51,899 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:35:51,899 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 15:35:51,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:35:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 15:35:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:35:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:35:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 15:35:51,905 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 15:35:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:51,905 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 15:35:51,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:35:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 15:35:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 15:35:51,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:51,906 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:51,906 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:51,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:51,906 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-11-23 15:35:51,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:51,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:51,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:51,988 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 15:35:51,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:51,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:52,000 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:35:52,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 15:35:52,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:52,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:52,052 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 15:35:52,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:52,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 15:35:52,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:35:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:35:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:35:52,068 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-23 15:35:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:52,144 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 15:35:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:35:52,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 15:35:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:52,145 INFO L225 Difference]: With dead ends: 37 [2018-11-23 15:35:52,145 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 15:35:52,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:35:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 15:35:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 15:35:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:35:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 15:35:52,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 15:35:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:52,150 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 15:35:52,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:35:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 15:35:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 15:35:52,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:52,151 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:52,151 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:52,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-11-23 15:35:52,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:52,231 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 15:35:52,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:52,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:52,236 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:35:52,253 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 15:35:52,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:52,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:52,269 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 15:35:52,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 15:35:52,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:35:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:35:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:35:52,284 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 15:35:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:52,349 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 15:35:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:35:52,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 15:35:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:52,350 INFO L225 Difference]: With dead ends: 40 [2018-11-23 15:35:52,350 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 15:35:52,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:35:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 15:35:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 15:35:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 15:35:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 15:35:52,354 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 15:35:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:52,354 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 15:35:52,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:35:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 15:35:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 15:35:52,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:52,355 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:52,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:52,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-11-23 15:35:52,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:52,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:52,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:52,429 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 15:35:52,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:52,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:52,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:52,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:52,464 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 15:35:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 15:35:52,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:35:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:35:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:35:52,480 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-23 15:35:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:52,580 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 15:35:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:35:52,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 15:35:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:52,581 INFO L225 Difference]: With dead ends: 43 [2018-11-23 15:35:52,581 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:35:52,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-23 15:35:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:35:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:35:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:35:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 15:35:52,588 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 15:35:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:52,588 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 15:35:52,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:35:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 15:35:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:35:52,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:52,589 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:52,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:52,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-11-23 15:35:52,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:52,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:52,688 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 15:35:52,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:52,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:35:52,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:35:52,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:52,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:52,724 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 15:35:52,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:52,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 15:35:52,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:35:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:35:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:35:52,740 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-23 15:35:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:52,837 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 15:35:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:35:52,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-23 15:35:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:52,838 INFO L225 Difference]: With dead ends: 46 [2018-11-23 15:35:52,838 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 15:35:52,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-23 15:35:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 15:35:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 15:35:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 15:35:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 15:35:52,842 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 15:35:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:52,842 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 15:35:52,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:35:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 15:35:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 15:35:52,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:52,843 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:52,843 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-11-23 15:35:52,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:52,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:52,937 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 15:35:52,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:52,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:52,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:35:52,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 15:35:52,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:52,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:52,988 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 15:35:53,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:53,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 15:35:53,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:35:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:35:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:35:53,004 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-11-23 15:35:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:53,124 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 15:35:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 15:35:53,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 15:35:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:53,125 INFO L225 Difference]: With dead ends: 49 [2018-11-23 15:35:53,125 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 15:35:53,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-23 15:35:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 15:35:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 15:35:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 15:35:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 15:35:53,130 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 15:35:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:53,130 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 15:35:53,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:35:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 15:35:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 15:35:53,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:53,132 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:53,132 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:53,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-11-23 15:35:53,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:53,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:53,249 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 15:35:53,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:53,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:35:53,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:35:53,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:53,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:53,314 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 15:35:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 15:35:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:35:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:35:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:35:53,340 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-23 15:35:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:53,475 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 15:35:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 15:35:53,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-23 15:35:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:53,476 INFO L225 Difference]: With dead ends: 52 [2018-11-23 15:35:53,476 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 15:35:53,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-11-23 15:35:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 15:35:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 15:35:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 15:35:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 15:35:53,480 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 15:35:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:53,480 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 15:35:53,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:35:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 15:35:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:35:53,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:53,481 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:53,481 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:53,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2018-11-23 15:35:53,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:53,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:53,600 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 15:35:53,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:53,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:53,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:35:53,647 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 15:35:53,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:53,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:53,671 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 15:35:53,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:53,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 15:35:53,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 15:35:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 15:35:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:35:53,697 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-23 15:35:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:53,849 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 15:35:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 15:35:53,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-23 15:35:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:53,851 INFO L225 Difference]: With dead ends: 55 [2018-11-23 15:35:53,851 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 15:35:53,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-11-23 15:35:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 15:35:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 15:35:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 15:35:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 15:35:53,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 15:35:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:53,859 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 15:35:53,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 15:35:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 15:35:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 15:35:53,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:53,860 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:53,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:53,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2018-11-23 15:35:53,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:53,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:54,010 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 15:35:54,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:54,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:54,019 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:35:54,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 15:35:54,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:54,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:54,085 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 15:35:54,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:54,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 15:35:54,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:35:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:35:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:35:54,110 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2018-11-23 15:35:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:54,252 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 15:35:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 15:35:54,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-23 15:35:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:54,254 INFO L225 Difference]: With dead ends: 58 [2018-11-23 15:35:54,254 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 15:35:54,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-11-23 15:35:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 15:35:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 15:35:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 15:35:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 15:35:54,260 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 15:35:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:54,260 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 15:35:54,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:35:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 15:35:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 15:35:54,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:54,261 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:54,262 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:54,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2018-11-23 15:35:54,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:54,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:54,400 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 15:35:54,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:54,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:54,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:54,444 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 15:35:54,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:54,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 15:35:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 15:35:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 15:35:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:35:54,469 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2018-11-23 15:35:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:54,607 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 15:35:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 15:35:54,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 15:35:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:54,608 INFO L225 Difference]: With dead ends: 61 [2018-11-23 15:35:54,608 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 15:35:54,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-11-23 15:35:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 15:35:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 15:35:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 15:35:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 15:35:54,613 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 15:35:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:54,613 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 15:35:54,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 15:35:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 15:35:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 15:35:54,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:54,614 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:54,615 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:54,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2018-11-23 15:35:54,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:54,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:54,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:54,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:54,744 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 15:35:54,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:54,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:35:54,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:35:54,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:54,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:54,794 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 15:35:54,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:54,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 15:35:54,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 15:35:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 15:35:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2018-11-23 15:35:54,816 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-11-23 15:35:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:54,970 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 15:35:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 15:35:54,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-11-23 15:35:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:54,971 INFO L225 Difference]: With dead ends: 64 [2018-11-23 15:35:54,971 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 15:35:54,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 15:35:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 15:35:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 15:35:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 15:35:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 15:35:54,976 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 15:35:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:54,976 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 15:35:54,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 15:35:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 15:35:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 15:35:54,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:54,977 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:54,977 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:54,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2018-11-23 15:35:54,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:54,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:54,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:55,098 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 15:35:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:55,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:35:55,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 15:35:55,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:55,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:55,153 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 15:35:55,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:55,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 15:35:55,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 15:35:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 15:35:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-11-23 15:35:55,169 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-11-23 15:35:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:55,337 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-23 15:35:55,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 15:35:55,337 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-11-23 15:35:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:55,338 INFO L225 Difference]: With dead ends: 67 [2018-11-23 15:35:55,338 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 15:35:55,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 15:35:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 15:35:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 15:35:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 15:35:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 15:35:55,343 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-11-23 15:35:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:55,343 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 15:35:55,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 15:35:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 15:35:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 15:35:55,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:55,345 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:55,345 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:55,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2018-11-23 15:35:55,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:55,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:55,507 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 15:35:55,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:55,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:55,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:35:55,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:35:55,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:55,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:55,563 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 15:35:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 15:35:55,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 15:35:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 15:35:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-11-23 15:35:55,579 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2018-11-23 15:35:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:55,780 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 15:35:55,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 15:35:55,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-11-23 15:35:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:55,781 INFO L225 Difference]: With dead ends: 70 [2018-11-23 15:35:55,781 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 15:35:55,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 15:35:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 15:35:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 15:35:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 15:35:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-23 15:35:55,786 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-11-23 15:35:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:55,790 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-23 15:35:55,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 15:35:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-23 15:35:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 15:35:55,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:55,791 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:55,792 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:55,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2018-11-23 15:35:55,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:55,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:55,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:55,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:55,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:56,013 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 15:35:56,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:56,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:56,022 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:35:56,075 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 15:35:56,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:56,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:56,099 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 15:35:56,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 15:35:56,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 15:35:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 15:35:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2018-11-23 15:35:56,115 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2018-11-23 15:35:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:56,304 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 15:35:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 15:35:56,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2018-11-23 15:35:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:56,305 INFO L225 Difference]: With dead ends: 73 [2018-11-23 15:35:56,305 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 15:35:56,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 15:35:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 15:35:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 15:35:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 15:35:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 15:35:56,308 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-11-23 15:35:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:56,308 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 15:35:56,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 15:35:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 15:35:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:35:56,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:56,308 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:56,309 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:56,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2018-11-23 15:35:56,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:56,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:56,540 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 15:35:56,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:56,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:35:56,588 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 15:35:56,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:56,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:56,607 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 15:35:56,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:56,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 15:35:56,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 15:35:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 15:35:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-11-23 15:35:56,623 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2018-11-23 15:35:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:56,827 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-23 15:35:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 15:35:56,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2018-11-23 15:35:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:56,828 INFO L225 Difference]: With dead ends: 76 [2018-11-23 15:35:56,828 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 15:35:56,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 15:35:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 15:35:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 15:35:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 15:35:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-23 15:35:56,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-11-23 15:35:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:56,834 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-23 15:35:56,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 15:35:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-23 15:35:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 15:35:56,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:56,835 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:56,835 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:56,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2018-11-23 15:35:56,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:56,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:57,016 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 15:35:57,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:57,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:57,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:57,085 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 15:35:57,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:57,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 15:35:57,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 15:35:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 15:35:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2018-11-23 15:35:57,110 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2018-11-23 15:35:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:57,335 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-23 15:35:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 15:35:57,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-11-23 15:35:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:57,336 INFO L225 Difference]: With dead ends: 79 [2018-11-23 15:35:57,336 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 15:35:57,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 15:35:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 15:35:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 15:35:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 15:35:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-23 15:35:57,339 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-11-23 15:35:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:57,340 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-23 15:35:57,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 15:35:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 15:35:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 15:35:57,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:57,341 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:57,341 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:57,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2018-11-23 15:35:57,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:35:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:57,536 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 15:35:57,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:57,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:57,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:35:57,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:35:57,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:57,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:57,603 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 15:35:57,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:57,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 15:35:57,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 15:35:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 15:35:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:35:57,619 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 25 states. [2018-11-23 15:35:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:57,849 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-23 15:35:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 15:35:57,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-11-23 15:35:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:57,850 INFO L225 Difference]: With dead ends: 82 [2018-11-23 15:35:57,850 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 15:35:57,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 15:35:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 15:35:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 15:35:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 15:35:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-23 15:35:57,854 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2018-11-23 15:35:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:57,855 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-23 15:35:57,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 15:35:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-23 15:35:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 15:35:57,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:57,856 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:57,856 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:57,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1648275844, now seen corresponding path program 21 times [2018-11-23 15:35:57,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:57,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:57,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:57,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:58,079 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 15:35:58,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:58,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:58,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:35:58,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 15:35:58,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:58,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:58,153 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 15:35:58,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:58,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 15:35:58,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 15:35:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 15:35:58,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-11-23 15:35:58,169 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2018-11-23 15:35:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:58,408 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-11-23 15:35:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 15:35:58,409 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2018-11-23 15:35:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:58,409 INFO L225 Difference]: With dead ends: 85 [2018-11-23 15:35:58,409 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 15:35:58,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 15:35:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 15:35:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 15:35:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 15:35:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-11-23 15:35:58,413 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 139 [2018-11-23 15:35:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:58,414 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-11-23 15:35:58,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 15:35:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-11-23 15:35:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 15:35:58,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:58,414 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:58,414 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1314278308, now seen corresponding path program 22 times [2018-11-23 15:35:58,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:58,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:58,663 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 15:35:58,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:58,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:35:58,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:35:58,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:58,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:58,724 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 15:35:58,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 15:35:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 15:35:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 15:35:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-11-23 15:35:58,739 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 27 states. [2018-11-23 15:35:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:58,982 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-23 15:35:58,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 15:35:58,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-11-23 15:35:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:58,984 INFO L225 Difference]: With dead ends: 88 [2018-11-23 15:35:58,984 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 15:35:58,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 15:35:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 15:35:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 15:35:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 15:35:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-23 15:35:58,991 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 145 [2018-11-23 15:35:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:58,992 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-23 15:35:58,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 15:35:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-23 15:35:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 15:35:58,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:58,993 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:58,993 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:58,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2015638980, now seen corresponding path program 23 times [2018-11-23 15:35:58,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:58,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:59,207 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 15:35:59,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:59,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:35:59,259 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 15:35:59,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:59,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:59,291 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 15:35:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:59,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 15:35:59,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 15:35:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 15:35:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2018-11-23 15:35:59,306 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 28 states. [2018-11-23 15:35:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:35:59,563 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-11-23 15:35:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 15:35:59,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2018-11-23 15:35:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:35:59,564 INFO L225 Difference]: With dead ends: 91 [2018-11-23 15:35:59,564 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 15:35:59,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 15:35:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 15:35:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-23 15:35:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 15:35:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-23 15:35:59,568 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 151 [2018-11-23 15:35:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:35:59,568 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-23 15:35:59,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 15:35:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-23 15:35:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 15:35:59,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:35:59,569 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:35:59,569 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:35:59,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:35:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 483163804, now seen corresponding path program 24 times [2018-11-23 15:35:59,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:35:59,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:35:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:59,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:35:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:35:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:35:59,808 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 15:35:59,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:35:59,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:35:59,814 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:35:59,864 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 15:35:59,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:35:59,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:35:59,891 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 15:35:59,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:35:59,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 15:35:59,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 15:35:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 15:35:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-11-23 15:35:59,907 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 29 states. [2018-11-23 15:36:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:00,194 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-11-23 15:36:00,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 15:36:00,195 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2018-11-23 15:36:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:00,195 INFO L225 Difference]: With dead ends: 94 [2018-11-23 15:36:00,195 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 15:36:00,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 15:36:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 15:36:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 15:36:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 15:36:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-23 15:36:00,199 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 157 [2018-11-23 15:36:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:00,199 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-23 15:36:00,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 15:36:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-23 15:36:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 15:36:00,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:00,200 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:00,200 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:00,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1060706820, now seen corresponding path program 25 times [2018-11-23 15:36:00,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:36:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:36:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:00,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:36:00,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:00,255 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~a~0 := 25;~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #32#return; VAL [main_~a~0=25, main_~b~0=0, |main_#t~ret1|=25] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] assume !false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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-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 #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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-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 #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L12] int a = 25; [L13] int b = 0; VAL [a=25, 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) VAL [a=25, b=0, sum(a, b)=25] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=25, b=0, result=25] [L16] __VERIFIER_error() VAL [a=25, b=0, result=25] ----- [2018-11-23 15:36:00,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:36:00 BoogieIcfgContainer [2018-11-23 15:36:00,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:36:00,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:36:00,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:36:00,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:36:00,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:50" (3/4) ... [2018-11-23 15:36:00,666 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~a~0 := 25;~b~0 := 0; VAL [main_~a~0=25, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #30#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 #32#return; VAL [main_~a~0=25, main_~b~0=0, |main_#t~ret1|=25] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] assume !false; VAL [main_~a~0=25, main_~b~0=0, main_~result~0=25] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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-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 #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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-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 #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 25; [L13] ~b~0 := 0; VAL [~a~0=25, ~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); VAL [#t~ret1=25, ~a~0=25, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=25, ~b~0=0, ~result~0=25] [L16] assert false; VAL [~a~0=25, ~b~0=0, ~result~0=25] [L12] int a = 25; [L13] int b = 0; VAL [a=25, 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) VAL [a=25, b=0, sum(a, b)=25] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=25, b=0, result=25] [L16] __VERIFIER_error() VAL [a=25, b=0, result=25] ----- [2018-11-23 15:36:01,606 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4438805c-e2f0-40d3-9530-77a8d38e6a3d/bin-2019/uautomizer/witness.graphml [2018-11-23 15:36:01,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:36:01,606 INFO L168 Benchmark]: Toolchain (without parser) took 11217.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.4 MB). Free memory was 959.3 MB in the beginning and 915.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 473.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,608 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:01,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.49 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:01,608 INFO L168 Benchmark]: Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,609 INFO L168 Benchmark]: RCFGBuilder took 176.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,609 INFO L168 Benchmark]: TraceAbstraction took 9927.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.1 MB). Free memory was 1.2 GB in the beginning and 926.3 MB in the end (delta: 225.1 MB). Peak memory consumption was 487.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,609 INFO L168 Benchmark]: Witness Printer took 942.07 ms. Allocated memory is still 1.5 GB. Free memory was 926.3 MB in the beginning and 915.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:01,611 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.49 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 176.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9927.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 262.1 MB). Free memory was 1.2 GB in the beginning and 926.3 MB in the end (delta: 225.1 MB). Peak memory consumption was 487.3 MB. Max. memory is 11.5 GB. * Witness Printer took 942.07 ms. Allocated memory is still 1.5 GB. Free memory was 926.3 MB in the beginning and 915.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [a=25, 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) VAL [a=25, b=0, sum(a, b)=25] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=25, b=0, result=25] [L16] __VERIFIER_error() VAL [a=25, b=0, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 26 OverallIterations, 26 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 303 SDtfs, 778 SDslu, 2713 SDs, 0 SdLazy, 2093 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3138 GetRequests, 2438 SyntacticMatches, 0 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4400 NumberOfCodeBlocks, 4400 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 4188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1139760 SizeOfPredicates, 348 NumberOfNonLiveVariables, 6288 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...