./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_10x0_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_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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 03b834537fd67eba3e98faa1fce1fca3851f5bba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53:40,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:53:40,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:53:40,037 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:53:40,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:53:40,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:53:40,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:53:40,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:53:40,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:53:40,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:53:40,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:53:40,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:53:40,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:53:40,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:53:40,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:53:40,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:53:40,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:53:40,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:53:40,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:53:40,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:53:40,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:53:40,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:53:40,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:53:40,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:53:40,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:53:40,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:53:40,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:53:40,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:53:40,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:53:40,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:53:40,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:53:40,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:53:40,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:53:40,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:53:40,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:53:40,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:53:40,058 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:53:40,068 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:53:40,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:53:40,069 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:53:40,069 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:53:40,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:53:40,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:53:40,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:53:40,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:53:40,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:53:40,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:53:40,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:53:40,073 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:53:40,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:53:40,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:53:40,073 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_495f2495-1e77-4732-9d68-05c895594797/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 -> 03b834537fd67eba3e98faa1fce1fca3851f5bba [2018-11-23 15:53:40,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:53:40,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:53:40,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:53:40,108 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:53:40,108 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:53:40,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-11-23 15:53:40,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/data/0ba94b977/f10213bc29a841809143827552e680bd/FLAGc3cdbb0db [2018-11-23 15:53:40,496 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:53:40,497 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-11-23 15:53:40,502 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/data/0ba94b977/f10213bc29a841809143827552e680bd/FLAGc3cdbb0db [2018-11-23 15:53:40,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/data/0ba94b977/f10213bc29a841809143827552e680bd [2018-11-23 15:53:40,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:53:40,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:53:40,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:40,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:53:40,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:53:40,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcb7b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40, skipping insertion in model container [2018-11-23 15:53:40,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:53:40,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:53:40,649 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:40,651 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:53:40,661 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:40,669 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:53:40,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40 WrapperNode [2018-11-23 15:53:40,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:40,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:40,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:53:40,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:53:40,676 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:53:40" (1/1) ... [2018-11-23 15:53:40,680 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:53:40" (1/1) ... [2018-11-23 15:53:40,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:40,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:53:40,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:53:40,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:53:40,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... [2018-11-23 15:53:40,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:53:40,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:53:40,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:53:40,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:53:40,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:53:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:53:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:53:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:53:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 15:53:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 15:53:40,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:53:40,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:53:40,877 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:53:40,877 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 15:53:40,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:40 BoogieIcfgContainer [2018-11-23 15:53:40,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:53:40,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:53:40,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:53:40,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:53:40,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:53:40" (1/3) ... [2018-11-23 15:53:40,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74312f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:40, skipping insertion in model container [2018-11-23 15:53:40,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:40" (2/3) ... [2018-11-23 15:53:40,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74312f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:40, skipping insertion in model container [2018-11-23 15:53:40,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:40" (3/3) ... [2018-11-23 15:53:40,882 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0_false-unreach-call_true-termination.c [2018-11-23 15:53:40,888 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:53:40,893 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:53:40,903 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:53:40,924 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:53:40,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:53:40,924 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:53:40,924 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:53:40,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:53:40,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:53:40,925 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:53:40,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:53:40,925 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:53:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 15:53:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:53:40,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:40,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:40,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:40,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-23 15:53:40,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:40,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:40,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:40,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,070 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:53:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:53:41,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:53:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:53:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:53:41,084 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 15:53:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:41,139 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 15:53:41,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:53:41,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 15:53:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:41,146 INFO L225 Difference]: With dead ends: 30 [2018-11-23 15:53:41,146 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 15:53:41,148 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:53:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 15:53:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 15:53:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:53:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 15:53:41,178 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 15:53:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:41,178 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 15:53:41,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:53:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 15:53:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:53:41,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:41,180 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:53:41,181 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:41,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-23 15:53:41,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:41,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,228 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:53:41,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:41,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:41,285 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:53:41,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:41,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 15:53:41,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:53:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:53:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:53:41,302 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 15:53:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:41,385 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 15:53:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:53:41,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:53:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:41,386 INFO L225 Difference]: With dead ends: 25 [2018-11-23 15:53:41,386 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 15:53:41,387 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:53:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 15:53:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 15:53:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 15:53:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 15:53:41,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 15:53:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:41,392 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 15:53:41,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:53:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 15:53:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:53:41,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:41,393 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:53:41,393 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:41,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-23 15:53:41,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:41,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,465 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:53:41,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:41,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:53:41,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:53:41,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:41,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:41,506 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:53:41,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:41,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 15:53:41,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:53:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:53:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:53:41,525 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 15:53:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:41,567 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 15:53:41,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:53:41,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 15:53:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:41,569 INFO L225 Difference]: With dead ends: 28 [2018-11-23 15:53:41,569 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 15:53:41,569 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:53:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 15:53:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 15:53:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:53:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 15:53:41,573 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 15:53:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:41,573 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 15:53:41,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:53:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 15:53:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:53:41,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:41,574 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:53:41,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:41,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-11-23 15:53:41,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,642 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:53:41,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:41,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:41,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:53:41,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 15:53:41,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:41,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:41,687 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:53:41,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:41,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 15:53:41,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:53:41,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:53:41,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:53:41,702 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-23 15:53:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:41,765 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 15:53:41,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:53:41,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-23 15:53:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:41,767 INFO L225 Difference]: With dead ends: 31 [2018-11-23 15:53:41,767 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 15:53:41,767 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:53:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 15:53:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 15:53:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 15:53:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 15:53:41,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 15:53:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:41,772 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 15:53:41,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:53:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 15:53:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:53:41,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:41,773 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:53:41,773 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:41,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-11-23 15:53:41,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:41,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:41,857 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:53:41,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:41,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:53:41,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:53:41,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:41,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:41,895 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:53:41,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:41,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 15:53:41,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:53:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:53:41,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:53:41,911 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 15:53:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:42,007 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 15:53:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:42,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 15:53:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:42,009 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:53:42,009 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 15:53:42,009 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:53:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 15:53:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:53:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:53:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 15:53:42,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 15:53:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 15:53:42,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:53:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 15:53:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 15:53:42,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:42,015 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:53:42,016 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-11-23 15:53:42,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:42,127 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:53:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:42,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:53:42,154 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 15:53:42,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:42,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:42,171 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:53:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 15:53:42,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:53:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:53:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:53:42,188 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-23 15:53:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:42,269 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 15:53:42,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:53:42,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 15:53:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:42,270 INFO L225 Difference]: With dead ends: 37 [2018-11-23 15:53:42,270 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 15:53:42,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:53:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 15:53:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 15:53:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:53:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 15:53:42,274 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 15:53:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:42,274 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 15:53:42,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:53:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 15:53:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 15:53:42,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:42,275 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:53:42,275 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:42,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-11-23 15:53:42,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:42,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:42,354 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:53:42,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:42,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:53:42,381 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 15:53:42,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:42,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:42,399 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:53:42,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:42,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 15:53:42,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:53:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:53:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:53:42,415 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 15:53:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:42,485 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 15:53:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:53:42,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 15:53:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:42,486 INFO L225 Difference]: With dead ends: 40 [2018-11-23 15:53:42,487 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 15:53:42,487 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:53:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 15:53:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 15:53:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 15:53:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 15:53:42,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 15:53:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:42,492 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 15:53:42,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:53:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 15:53:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 15:53:42,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:42,492 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:53:42,493 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:42,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-11-23 15:53:42,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:42,573 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:53:42,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:42,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:42,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:42,612 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:53:42,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:42,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 15:53:42,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:53:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:53:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:53:42,628 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-23 15:53:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:42,731 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 15:53:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:53:42,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 15:53:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:42,732 INFO L225 Difference]: With dead ends: 43 [2018-11-23 15:53:42,733 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:53:42,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-23 15:53:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:53:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:53:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:53:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 15:53:42,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 15:53:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:42,740 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 15:53:42,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:53:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 15:53:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:53:42,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:42,741 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:53:42,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:42,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-11-23 15:53:42,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:42,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:42,862 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:53:42,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:42,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:42,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:53:42,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:53:42,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:42,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:42,904 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:53:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 15:53:42,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:53:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:53:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:53:42,930 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-23 15:53:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:43,012 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 15:53:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:53:43,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-23 15:53:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:43,013 INFO L225 Difference]: With dead ends: 46 [2018-11-23 15:53:43,013 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 15:53:43,014 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:53:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 15:53:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 15:53:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 15:53:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 15:53:43,018 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 15:53:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:43,018 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 15:53:43,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:53:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 15:53:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 15:53:43,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:43,019 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:53:43,019 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:43,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-11-23 15:53:43,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:43,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:43,120 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:53:43,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:53:43,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/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:53:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:53:43,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 15:53:43,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:53:43,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:43,178 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:53:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 15:53:43,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:53:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:53:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:53:43,195 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-11-23 15:53:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:43,290 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 15:53:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 15:53:43,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 15:53:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:43,292 INFO L225 Difference]: With dead ends: 49 [2018-11-23 15:53:43,292 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 15:53:43,292 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:53:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 15:53:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 15:53:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 15:53:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 15:53:43,296 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 15:53:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 15:53:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:53:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 15:53:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 15:53:43,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:43,297 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:53:43,297 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:43,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-11-23 15:53:43,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:43,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:53:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:53:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:53:43,335 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 := 10;~b~0 := 0; VAL [main_~a~0=10, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0, |sum_#res|=10] [?] assume true; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#res|=10] [?] assume true; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#res|=10] [?] assume true; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#res|=10] [?] assume true; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#res|=10] [?] assume true; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#res|=10] [?] assume true; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#res|=10] [?] assume true; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#res|=10] [?] assume true; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#res|=10] [?] assume true; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#res|=10] [?] assume true; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#res|=10] [?] assume true; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#res|=10] [?] RET #32#return; VAL [main_~a~0=10, main_~b~0=0, |main_#t~ret1|=10] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] assume !false; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L3-L9] ensures true; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L3-L9] ensures true; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L3-L9] ensures true; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L3-L9] ensures true; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L3-L9] ensures true; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L3-L9] ensures true; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L3-L9] ensures true; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L3-L9] ensures true; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L3-L9] ensures true; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L3-L9] ensures true; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L3-L9] ensures true; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L3-L9] ensures true; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L3-L9] ensures true; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L3-L9] ensures true; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L3-L9] ensures true; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L3-L9] ensures true; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L3-L9] ensures true; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L3-L9] ensures true; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L3-L9] ensures true; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L3-L9] ensures true; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L3-L9] ensures true; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L3-L9] ensures true; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L12] int a = 10; [L13] int b = 0; VAL [a=10, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L16] __VERIFIER_error() VAL [a=10, b=0, result=10] ----- [2018-11-23 15:53:43,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:53:43 BoogieIcfgContainer [2018-11-23 15:53:43,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:53:43,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:53:43,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:53:43,405 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:53:43,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:40" (3/4) ... [2018-11-23 15:53:43,408 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~a~0 := 10;~b~0 := 0; VAL [main_~a~0=10, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0, |sum_#res|=10] [?] assume true; VAL [sum_~m=10, sum_~n=0, |sum_#in~m|=10, |sum_#in~n|=0, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#res|=10] [?] assume true; VAL [sum_~m=9, sum_~n=1, |sum_#in~m|=9, |sum_#in~n|=1, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#res|=10] [?] assume true; VAL [sum_~m=8, sum_~n=2, |sum_#in~m|=8, |sum_#in~n|=2, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#res|=10] [?] assume true; VAL [sum_~m=7, sum_~n=3, |sum_#in~m|=7, |sum_#in~n|=3, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#res|=10] [?] assume true; VAL [sum_~m=6, sum_~n=4, |sum_#in~m|=6, |sum_#in~n|=4, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#res|=10] [?] assume true; VAL [sum_~m=5, sum_~n=5, |sum_#in~m|=5, |sum_#in~n|=5, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#res|=10] [?] assume true; VAL [sum_~m=4, sum_~n=6, |sum_#in~m|=4, |sum_#in~n|=6, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#res|=10] [?] assume true; VAL [sum_~m=3, sum_~n=7, |sum_#in~m|=3, |sum_#in~n|=7, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#res|=10] [?] assume true; VAL [sum_~m=2, sum_~n=8, |sum_#in~m|=2, |sum_#in~n|=8, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#res|=10] [?] assume true; VAL [sum_~m=1, sum_~n=9, |sum_#in~m|=1, |sum_#in~n|=9, |sum_#res|=10] [?] RET #30#return; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#res|=10] [?] assume true; VAL [sum_~m=0, sum_~n=10, |sum_#in~m|=0, |sum_#in~n|=10, |sum_#res|=10] [?] RET #32#return; VAL [main_~a~0=10, main_~b~0=0, |main_#t~ret1|=10] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] assume !false; VAL [main_~a~0=10, main_~b~0=0, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L3-L9] ensures true; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L3-L9] ensures true; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L3-L9] ensures true; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L3-L9] ensures true; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L3-L9] ensures true; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L3-L9] ensures true; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L3-L9] ensures true; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L3-L9] ensures true; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L3-L9] ensures true; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L3-L9] ensures true; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L3-L9] ensures true; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L3-L9] ensures true; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L3-L9] ensures true; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L3-L9] ensures true; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L3-L9] ensures true; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L3-L9] ensures true; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L3-L9] ensures true; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L3-L9] ensures true; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L3-L9] ensures true; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L3-L9] ensures true; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L3-L9] ensures true; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L3-L9] ensures true; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] ----- ----- 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 := 10; [L13] ~b~0 := 0; VAL [~a~0=10, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=10, ~m=0, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=9, ~m=1, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=8, ~m=2, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=7, ~m=3, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=6, ~m=4, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=5, ~m=5, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=4, ~m=6, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=3, ~m=7, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=2, ~m=8, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=1, ~m=9, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=0, ~m=10, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=10, #in~n=0, #res=10, ~m=10, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=1, #t~ret0=10, ~m=9, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=1, #res=10, ~m=9, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=2, #t~ret0=10, ~m=8, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=2, #res=10, ~m=8, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=3, #t~ret0=10, ~m=7, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=3, #res=10, ~m=7, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=4, #t~ret0=10, ~m=6, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=4, #res=10, ~m=6, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=5, #t~ret0=10, ~m=5, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=5, #res=10, ~m=5, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=6, #t~ret0=10, ~m=4, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=6, #res=10, ~m=4, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=7, #t~ret0=10, ~m=3, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=7, #res=10, ~m=3, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=8, #t~ret0=10, ~m=2, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=8, #res=10, ~m=2, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=9, #t~ret0=10, ~m=1, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=9, #res=10, ~m=1, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=10, #t~ret0=10, ~m=0, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=10, #res=10, ~m=0, ~n=10] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=10, ~a~0=10, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=10, ~b~0=0, ~result~0=10] [L16] assert false; VAL [~a~0=10, ~b~0=0, ~result~0=10] [L12] int a = 10; [L13] int b = 0; VAL [a=10, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L16] __VERIFIER_error() VAL [a=10, b=0, result=10] ----- [2018-11-23 15:53:43,586 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_495f2495-1e77-4732-9d68-05c895594797/bin-2019/uautomizer/witness.graphml [2018-11-23 15:53:43,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:53:43,587 INFO L168 Benchmark]: Toolchain (without parser) took 3072.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.1 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:43,588 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:43,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 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:53:43,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.40 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:43,589 INFO L168 Benchmark]: Boogie Preprocessor took 12.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 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:53:43,589 INFO L168 Benchmark]: RCFGBuilder took 181.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:43,590 INFO L168 Benchmark]: TraceAbstraction took 2526.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.2 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:43,590 INFO L168 Benchmark]: Witness Printer took 181.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:43,592 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 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 13.40 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2526.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.2 MB). Peak memory consumption was 138.3 MB. Max. memory is 11.5 GB. * Witness Printer took 181.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 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 = 10; [L13] int b = 0; VAL [a=10, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L16] __VERIFIER_error() VAL [a=10, b=0, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 163 SDslu, 555 SDs, 0 SdLazy, 434 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 860 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 87360 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1123 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 900/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...