./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_15x0_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_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31319b3dce926b7eddaa50d24c240f6870931f21 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:33:38,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:33:38,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:33:38,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:33:38,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:33:38,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:33:38,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:33:38,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:33:38,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:33:38,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:33:38,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:33:38,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:33:38,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:33:38,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:33:38,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:33:38,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:33:38,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:33:38,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:33:38,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:33:38,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:33:38,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:33:38,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:33:38,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:33:38,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:33:38,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:33:38,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:33:38,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:33:38,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:33:38,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:33:38,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:33:38,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:33:38,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:33:38,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:33:38,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:33:38,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:33:38,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:33:38,950 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:33:38,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:33:38,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:33:38,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:33:38,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:33:38,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:33:38,962 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:33:38,963 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:33:38,963 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:33:38,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:33:38,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:33:38,965 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:33:38,965 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:33:38,965 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:33:38,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:33:38,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:33:38,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:33:38,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:33:38,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:33:38,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:33:38,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:33:38,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:33:38,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31319b3dce926b7eddaa50d24c240f6870931f21 [2018-11-23 02:33:38,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:33:39,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:33:39,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:33:39,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:33:39,004 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:33:39,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-11-23 02:33:39,047 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/data/e92666bbd/e2192aa4ae8b48489f80f1c7a2ccf0a3/FLAG53304f480 [2018-11-23 02:33:39,454 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:33:39,454 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-11-23 02:33:39,458 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/data/e92666bbd/e2192aa4ae8b48489f80f1c7a2ccf0a3/FLAG53304f480 [2018-11-23 02:33:39,467 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/data/e92666bbd/e2192aa4ae8b48489f80f1c7a2ccf0a3 [2018-11-23 02:33:39,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:33:39,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:33:39,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:33:39,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:33:39,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:33:39,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4044db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39, skipping insertion in model container [2018-11-23 02:33:39,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:33:39,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:33:39,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:33:39,598 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:33:39,606 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:33:39,614 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:33:39,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39 WrapperNode [2018-11-23 02:33:39,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:33:39,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:33:39,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:33:39,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:33:39,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:33:39,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:33:39,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:33:39,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:33:39,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... [2018-11-23 02:33:39,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:33:39,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:33:39,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:33:39,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:33:39,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:33:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:33:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:33:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:33:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:33:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 02:33:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 02:33:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:33:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:33:39,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:33:39,796 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:33:39,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:39 BoogieIcfgContainer [2018-11-23 02:33:39,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:33:39,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:33:39,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:33:39,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:33:39,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:33:39" (1/3) ... [2018-11-23 02:33:39,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a13eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:39, skipping insertion in model container [2018-11-23 02:33:39,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39" (2/3) ... [2018-11-23 02:33:39,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a13eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:39, skipping insertion in model container [2018-11-23 02:33:39,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:39" (3/3) ... [2018-11-23 02:33:39,801 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0_false-unreach-call_true-termination.c [2018-11-23 02:33:39,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:33:39,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:33:39,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:33:39,838 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:33:39,838 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:33:39,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:33:39,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:33:39,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:33:39,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:33:39,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:33:39,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:33:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 02:33:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:33:39,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:39,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:39,859 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:39,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-23 02:33:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:39,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:39,981 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 02:33:39,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:33:39,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:33:39,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:33:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:33:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:33:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:33:40,000 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 02:33:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:40,053 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 02:33:40,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:33:40,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 02:33:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:40,062 INFO L225 Difference]: With dead ends: 30 [2018-11-23 02:33:40,062 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 02:33:40,064 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 02:33:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 02:33:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 02:33:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 02:33:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 02:33:40,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 02:33:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:40,091 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 02:33:40,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:33:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 02:33:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:33:40,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:40,092 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 02:33:40,092 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:40,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-23 02:33:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:40,156 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 02:33:40,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:40,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:40,157 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 02:33:40,159 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2018-11-23 02:33:40,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:33:40,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:33:40,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:33:40,282 INFO L272 AbstractInterpreter]: Visited 17 different actions 50 times. Never merged. Widened at 1 different actions 2 times. Performed 130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-23 02:33:40,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:40,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:33:40,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:40,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:40,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:40,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:33:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:40,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:40,345 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 02:33:40,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:33:40,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:40,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2018-11-23 02:33:40,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:40,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:33:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:33:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:33:40,548 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 02:33:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:40,591 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 02:33:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:33:40,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 02:33:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:40,592 INFO L225 Difference]: With dead ends: 25 [2018-11-23 02:33:40,592 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 02:33:40,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:33:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 02:33:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 02:33:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 02:33:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 02:33:40,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 02:33:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:40,597 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 02:33:40,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:33:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 02:33:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:33:40,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:40,598 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 02:33:40,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:40,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:40,598 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-23 02:33:40,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:40,649 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 02:33:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:40,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:40,649 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:40,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:40,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:33:40,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:33:40,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:33:40,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:40,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:40,675 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 02:33:40,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 02:33:40,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:40,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-11-23 02:33:40,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:40,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:33:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:33:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:33:40,925 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 02:33:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:40,988 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 02:33:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:33:40,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 02:33:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:40,988 INFO L225 Difference]: With dead ends: 28 [2018-11-23 02:33:40,989 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 02:33:40,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:33:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 02:33:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 02:33:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 02:33:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 02:33:40,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 02:33:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:40,992 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 02:33:40,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:33:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 02:33:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 02:33:40,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:40,993 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 02:33:40,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:40,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-11-23 02:33:40,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:40,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:41,047 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 02:33:41,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:41,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:41,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:41,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:41,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:41,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:33:41,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:33:41,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:33:41,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:41,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:41,087 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 02:33:41,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:33:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2018-11-23 02:33:41,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:41,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:33:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:33:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:33:41,378 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-23 02:33:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:41,414 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 02:33:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:33:41,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-23 02:33:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:41,415 INFO L225 Difference]: With dead ends: 31 [2018-11-23 02:33:41,415 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 02:33:41,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:33:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 02:33:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 02:33:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:33:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 02:33:41,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 02:33:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:41,420 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 02:33:41,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:33:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 02:33:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:33:41,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:41,421 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 02:33:41,421 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:41,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-11-23 02:33:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:41,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:41,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:41,493 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 02:33:41,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:41,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:41,494 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:41,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:41,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:41,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:41,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:41,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:33:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:41,528 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 02:33:41,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 02:33:41,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:41,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-11-23 02:33:41,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:33:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:33:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:33:41,964 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 02:33:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:42,011 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 02:33:42,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:33:42,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 02:33:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:42,012 INFO L225 Difference]: With dead ends: 34 [2018-11-23 02:33:42,012 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 02:33:42,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:33:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 02:33:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 02:33:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:33:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 02:33:42,016 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 02:33:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:42,016 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 02:33:42,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:33:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 02:33:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 02:33:42,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:42,017 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 02:33:42,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:42,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-11-23 02:33:42,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:42,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:42,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:42,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:42,094 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 02:33:42,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:42,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:42,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:42,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:42,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:42,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:33:42,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:33:42,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 02:33:42,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:42,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:42,136 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 02:33:42,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 02:33:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:42,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2018-11-23 02:33:42,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:42,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:33:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:33:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:33:42,774 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-23 02:33:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:42,826 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 02:33:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:33:42,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 02:33:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:42,827 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:33:42,827 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:33:42,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:33:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:33:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:33:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:33:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 02:33:42,831 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 02:33:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:42,832 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 02:33:42,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:33:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 02:33:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 02:33:42,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:42,833 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 02:33:42,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:42,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-11-23 02:33:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:42,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:42,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:42,914 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 02:33:42,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:42,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:42,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:42,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:42,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:42,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:33:42,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:33:42,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:33:42,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:42,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:42,955 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 02:33:42,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 02:33:43,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:43,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2018-11-23 02:33:43,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:43,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:33:43,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:33:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-23 02:33:43,781 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 02:33:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:43,844 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 02:33:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:33:43,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 02:33:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:43,845 INFO L225 Difference]: With dead ends: 40 [2018-11-23 02:33:43,845 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:33:43,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2018-11-23 02:33:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:33:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 02:33:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:33:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 02:33:43,849 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 02:33:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:43,849 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 02:33:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:33:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 02:33:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 02:33:43,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:43,849 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 02:33:43,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:43,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-11-23 02:33:43,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:43,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:43,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:43,922 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 02:33:43,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:43,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:43,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:43,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:43,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:43,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/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 02:33:43,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:43,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:33:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:43,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:43,952 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 02:33:43,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 02:33:45,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:45,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2018-11-23 02:33:45,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:45,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:33:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:33:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:33:45,075 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-23 02:33:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:45,155 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 02:33:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:33:45,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 02:33:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:45,156 INFO L225 Difference]: With dead ends: 43 [2018-11-23 02:33:45,156 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:33:45,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-11-23 02:33:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:33:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 02:33:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:33:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 02:33:45,162 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 02:33:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:45,162 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 02:33:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:33:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 02:33:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 02:33:45,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:45,163 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 02:33:45,163 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-11-23 02:33:45,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:45,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:45,242 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 02:33:45,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:45,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:45,243 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:45,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:45,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/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 02:33:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:33:45,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:33:45,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 02:33:45,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:45,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:45,279 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 02:33:45,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 02:33:46,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2018-11-23 02:33:46,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:46,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:33:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:33:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-11-23 02:33:46,769 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-23 02:33:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:46,846 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 02:33:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:33:46,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-23 02:33:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:46,847 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:33:46,847 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 02:33:46,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2018-11-23 02:33:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 02:33:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 02:33:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 02:33:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 02:33:46,851 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 02:33:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:46,851 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 02:33:46,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:33:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 02:33:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 02:33:46,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:46,852 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 02:33:46,852 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:46,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-11-23 02:33:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:46,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:46,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:46,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:46,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:46,938 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 02:33:46,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:46,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:46,939 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:46,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:46,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:46,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/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 02:33:46,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:33:46,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:33:46,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:33:46,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:46,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:46,968 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 02:33:46,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 02:33:48,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:48,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2018-11-23 02:33:48,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:48,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:33:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:33:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:33:48,967 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-11-23 02:33:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:49,038 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 02:33:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:33:49,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 02:33:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:49,040 INFO L225 Difference]: With dead ends: 49 [2018-11-23 02:33:49,040 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 02:33:49,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 02:33:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 02:33:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 02:33:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 02:33:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 02:33:49,044 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 02:33:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:49,044 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 02:33:49,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:33:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 02:33:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 02:33:49,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:49,046 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 02:33:49,046 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:49,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-11-23 02:33:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:49,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:49,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 02:33:49,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:49,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:49,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:49,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:49,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:49,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:49,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:33:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:49,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 02:33:49,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 02:33:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2018-11-23 02:33:51,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:51,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 02:33:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:33:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-11-23 02:33:51,666 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-23 02:33:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:51,767 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 02:33:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:33:51,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-23 02:33:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:51,768 INFO L225 Difference]: With dead ends: 52 [2018-11-23 02:33:51,768 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 02:33:51,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 02:33:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 02:33:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 02:33:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 02:33:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 02:33:51,773 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 02:33:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:51,773 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 02:33:51,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 02:33:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 02:33:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 02:33:51,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:51,774 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:51,775 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:51,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2018-11-23 02:33:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:51,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 02:33:51,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:51,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:51,901 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:51,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:51,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:51,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:33:51,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:33:51,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 02:33:51,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:51,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 02:33:51,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 02:33:55,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:55,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2018-11-23 02:33:55,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:55,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:33:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:33:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-11-23 02:33:55,172 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-23 02:33:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:55,288 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 02:33:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:33:55,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-23 02:33:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:55,290 INFO L225 Difference]: With dead ends: 55 [2018-11-23 02:33:55,290 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 02:33:55,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 02:33:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 02:33:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 02:33:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 02:33:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 02:33:55,293 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 02:33:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:55,294 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 02:33:55,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:33:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 02:33:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 02:33:55,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:55,295 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:55,295 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:55,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2018-11-23 02:33:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:55,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:55,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 02:33:55,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:55,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:55,405 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:55,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:55,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:55,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:33:55,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:33:55,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:33:55,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:33:55,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 02:33:55,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:33:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 02:33:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:33:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2018-11-23 02:33:59,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:33:59,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:33:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:33:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2018-11-23 02:33:59,653 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2018-11-23 02:33:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:59,765 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 02:33:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:33:59,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-23 02:33:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:59,766 INFO L225 Difference]: With dead ends: 58 [2018-11-23 02:33:59,766 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 02:33:59,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 02:33:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 02:33:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 02:33:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 02:33:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 02:33:59,770 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 02:33:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:59,771 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 02:33:59,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:33:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 02:33:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:33:59,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:59,771 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:59,771 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:59,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2018-11-23 02:33:59,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:33:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:59,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:33:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:59,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:33:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 02:33:59,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:59,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:33:59,875 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:33:59,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:33:59,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:59,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:33:59,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:59,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:33:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:59,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 02:33:59,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:34:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 02:34:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:34:04,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2018-11-23 02:34:04,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:34:04,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:34:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:34:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 02:34:04,982 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2018-11-23 02:34:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:05,126 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 02:34:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 02:34:05,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 02:34:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:05,127 INFO L225 Difference]: With dead ends: 61 [2018-11-23 02:34:05,128 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 02:34:05,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 02:34:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 02:34:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 02:34:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 02:34:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 02:34:05,131 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 02:34:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:05,132 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 02:34:05,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:34:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 02:34:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 02:34:05,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:05,133 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:34:05,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:05,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2018-11-23 02:34:05,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:34:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:05,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:34:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 02:34:05,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:34:05,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:34:05,295 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:34:05,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:34:05,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:34:05,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:34:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:34:05,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:34:05,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 02:34:05,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:34:05,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 02:34:05,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:34:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 02:34:11,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:34:11,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2018-11-23 02:34:11,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:34:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 02:34:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:34:11,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:34:11,516 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-11-23 02:34:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:11,698 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 02:34:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:34:11,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-11-23 02:34:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:11,699 INFO L225 Difference]: With dead ends: 64 [2018-11-23 02:34:11,699 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 02:34:11,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 31 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=800, Invalid=1552, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 02:34:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 02:34:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 02:34:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 02:34:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 02:34:11,704 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 02:34:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:11,704 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 02:34:11,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 02:34:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 02:34:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 02:34:11,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:11,705 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:34:11,705 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:11,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2018-11-23 02:34:11,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:34:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:11,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:34:11,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:11,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:34:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:11,734 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 := 15;~b~0 := 0; VAL [main_~a~0=15, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] assume true; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] assume true; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] assume true; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] assume true; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] assume true; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] assume true; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] assume true; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] assume true; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] assume true; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] assume true; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] assume true; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] assume true; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] assume true; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] assume true; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] assume true; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] assume true; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] RET #32#return; VAL [main_~a~0=15, main_~b~0=0, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume !false; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L12] int a = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] ----- [2018-11-23 02:34:11,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:34:11 BoogieIcfgContainer [2018-11-23 02:34:11,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:34:11,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:34:11,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:34:11,862 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:34:11,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:39" (3/4) ... [2018-11-23 02:34:11,864 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 := 15;~b~0 := 0; VAL [main_~a~0=15, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] assume true; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] assume true; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] assume true; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] assume true; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] assume true; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] assume true; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] assume true; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] assume true; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] assume true; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] assume true; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] assume true; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] assume true; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] assume true; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] assume true; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] assume true; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] assume true; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] RET #32#return; VAL [main_~a~0=15, main_~b~0=0, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume !false; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L12] int a = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] ----- [2018-11-23 02:34:12,262 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9580fba2-0344-4b31-9043-58a3d519a86a/bin-2019/utaipan/witness.graphml [2018-11-23 02:34:12,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:34:12,263 INFO L168 Benchmark]: Toolchain (without parser) took 32793.70 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 771.2 MB). Free memory was 958.1 MB in the beginning and 1.7 GB in the end (delta: -788.1 MB). Peak memory consumption was 846.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,264 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:34:12,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.39 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:34:12,265 INFO L168 Benchmark]: Boogie Preprocessor took 10.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,265 INFO L168 Benchmark]: RCFGBuilder took 158.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -206.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,266 INFO L168 Benchmark]: TraceAbstraction took 32064.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 553.1 MB). Free memory was 1.2 GB in the beginning and 838.7 MB in the end (delta: 312.3 MB). Peak memory consumption was 865.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,266 INFO L168 Benchmark]: Witness Printer took 401.15 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 53.5 MB). Free memory was 830.2 MB in the beginning and 1.7 GB in the end (delta: -915.9 MB). Peak memory consumption was 577.4 kB. Max. memory is 11.5 GB. [2018-11-23 02:34:12,268 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.39 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -206.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32064.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 553.1 MB). Free memory was 1.2 GB in the beginning and 838.7 MB in the end (delta: 312.3 MB). Peak memory consumption was 865.4 MB. Max. memory is 11.5 GB. * Witness Printer took 401.15 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 53.5 MB). Free memory was 830.2 MB in the beginning and 1.7 GB in the end (delta: -915.9 MB). Peak memory consumption was 577.4 kB. 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 = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 32.0s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 318 SDslu, 1173 SDs, 0 SdLazy, 918 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2015 GetRequests, 1374 SyntacticMatches, 239 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3554 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 1740 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 2406 ConstructedInterpolants, 0 QuantifiedInterpolants, 462912 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2408 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...