./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_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_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd82318ec795f8c5ba1d6bd1e94de4995b910941 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:41:46,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:41:46,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:41:46,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:41:46,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:41:46,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:41:46,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:41:46,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:41:46,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:41:46,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:41:46,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:41:46,848 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:41:46,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:41:46,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:41:46,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:41:46,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:41:46,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:41:46,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:41:46,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:41:46,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:41:46,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:41:46,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:41:46,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:41:46,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:41:46,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:41:46,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:41:46,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:41:46,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:41:46,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:41:46,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:41:46,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:41:46,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:41:46,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:41:46,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:41:46,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:41:46,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:41:46,864 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:41:46,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:41:46,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:41:46,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:41:46,875 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:41:46,875 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:41:46,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:41:46,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:41:46,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:41:46,877 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:41:46,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:41:46,878 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:41:46,878 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:41:46,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:41:46,879 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:41:46,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:41:46,879 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd82318ec795f8c5ba1d6bd1e94de4995b910941 [2018-11-23 00:41:46,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:41:46,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:41:46,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:41:46,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:41:46,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:41:46,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:41:46,949 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/data/9910c45d6/642d3d78d48d430091dcc28917f7e4fa/FLAGbe92fb3a4 [2018-11-23 00:41:47,349 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:41:47,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/sv-benchmarks/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:41:47,354 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/data/9910c45d6/642d3d78d48d430091dcc28917f7e4fa/FLAGbe92fb3a4 [2018-11-23 00:41:47,364 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/data/9910c45d6/642d3d78d48d430091dcc28917f7e4fa [2018-11-23 00:41:47,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:41:47,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:41:47,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:41:47,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:41:47,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:41:47,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47, skipping insertion in model container [2018-11-23 00:41:47,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:41:47,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:41:47,495 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:41:47,498 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:41:47,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:41:47,516 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:41:47,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47 WrapperNode [2018-11-23 00:41:47,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:41:47,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:41:47,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:41:47,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:41:47,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:41:47,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:41:47,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:41:47,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:41:47,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... [2018-11-23 00:41:47,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:41:47,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:41:47,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:41:47,549 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:41:47,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:41:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:41:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:41:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:41:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:41:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2018-11-23 00:41:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2018-11-23 00:41:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:41:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:41:47,745 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:41:47,745 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:41:47,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:47 BoogieIcfgContainer [2018-11-23 00:41:47,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:41:47,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:41:47,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:41:47,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:41:47,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:47" (1/3) ... [2018-11-23 00:41:47,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38680f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:47, skipping insertion in model container [2018-11-23 00:41:47,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:47" (2/3) ... [2018-11-23 00:41:47,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38680f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:47, skipping insertion in model container [2018-11-23 00:41:47,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:47" (3/3) ... [2018-11-23 00:41:47,752 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:41:47,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:41:47,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:41:47,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:41:47,807 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:41:47,808 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:41:47,808 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:41:47,808 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:41:47,808 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:41:47,808 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:41:47,808 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:41:47,808 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:41:47,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:41:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 00:41:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 00:41:47,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:47,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:47,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:47,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1796234678, now seen corresponding path program 1 times [2018-11-23 00:41:47,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:47,988 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 00:41:47,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:41:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:41:47,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:41:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:41:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:41:48,001 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2018-11-23 00:41:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:48,098 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2018-11-23 00:41:48,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:41:48,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 00:41:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:48,106 INFO L225 Difference]: With dead ends: 55 [2018-11-23 00:41:48,107 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 00:41:48,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 00:41:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 00:41:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 00:41:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 00:41:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 00:41:48,139 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2018-11-23 00:41:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:48,139 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 00:41:48,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:41:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-11-23 00:41:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:41:48,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:48,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:48,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash -895156504, now seen corresponding path program 1 times [2018-11-23 00:41:48,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:48,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:48,230 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 00:41:48,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:41:48,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:41:48,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:48,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:41:48,294 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 00:41:48,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:41:48,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2018-11-23 00:41:48,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:41:48,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:41:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:41:48,323 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-11-23 00:41:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:48,440 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2018-11-23 00:41:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:41:48,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 00:41:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:48,442 INFO L225 Difference]: With dead ends: 49 [2018-11-23 00:41:48,442 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:41:48,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:41:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:41:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:41:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:41:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2018-11-23 00:41:48,451 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 22 [2018-11-23 00:41:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2018-11-23 00:41:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:41:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2018-11-23 00:41:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 00:41:48,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:48,452 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:48,452 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:48,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 687949058, now seen corresponding path program 2 times [2018-11-23 00:41:48,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:48,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:48,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:41:48,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:41:48,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:41:48,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:41:48,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:41:48,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:41:48,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:41:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:41:48,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:41:48,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 00:41:48,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:41:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:41:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:41:48,527 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand 4 states. [2018-11-23 00:41:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:48,559 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2018-11-23 00:41:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:41:48,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 00:41:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:48,561 INFO L225 Difference]: With dead ends: 88 [2018-11-23 00:41:48,561 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 00:41:48,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:41:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 00:41:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 00:41:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 00:41:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2018-11-23 00:41:48,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 29 [2018-11-23 00:41:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:48,569 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2018-11-23 00:41:48,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:41:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2018-11-23 00:41:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 00:41:48,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:48,570 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:48,571 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:48,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1711672813, now seen corresponding path program 1 times [2018-11-23 00:41:48,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:41:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:41:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:41:48,612 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=2] [?] assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~m~0=2, main_~n~0=0] [?] assume !(~n~0 < 0 || ~n~0 > 23); VAL [main_~m~0=2, main_~n~0=0] [?] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [|ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] assume !(0 == ~m); VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] assume 0 == ~n; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [|ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] assume !(0 == ~m); VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] assume !(0 == ~n); VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [|ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] assume !(0 == ~m); VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] assume 0 == ~n; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [|ackermann_#in~m|=0, |ackermann_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1] [?] assume 0 == ~m;#res := 1 + ~n; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1, |ackermann_#res|=2] [?] assume true; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1, |ackermann_#res|=2] [?] RET #44#return; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#res|=2] [?] assume true; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#res|=2] [?] RET #46#return; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2] [?] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [|ackermann_#in~m|=0, |ackermann_#in~n|=2] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2] [?] assume 0 == ~m;#res := 1 + ~n; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2, |ackermann_#res|=3] [?] RET #48#return; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2, |ackermann_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#res|=3] [?] RET #44#return; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#res|=3] [?] RET #50#return; VAL [main_~m~0=2, main_~n~0=0, |main_#t~ret5|=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] assume !false; VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27-L31] assume !(~m~0 < 0 || ~m~0 > 3); [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33-L38] assume !(~n~0 < 0 || ~n~0 > 23); VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18-L20] assume !(0 == ~n); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L14-L22] ensures true; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L14-L22] ensures true; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L14-L22] ensures true; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L14-L22] ensures true; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L14-L22] ensures true; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40-L44] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27-L31] assume !(~m~0 < 0 || ~m~0 > 3); [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33-L38] assume !(~n~0 < 0 || ~n~0 > 23); VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18-L20] assume !(0 == ~n); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L14-L22] ensures true; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L14-L22] ensures true; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L14-L22] ensures true; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L14-L22] ensures true; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L14-L22] ensures true; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40-L44] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0 || m > 3) [L32] int n = __VERIFIER_nondet_int(); [L33] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L39] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L18] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L18] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L21] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L18] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, ackermann(m-1,1)=2, m=1, n=0] [L19] return ackermann(m-1,1); [L21] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, m=1, n=1] [L21] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L21] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, ackermann(m-1,ackermann(m,n-1))=3, m=1, n=1] [L21] return ackermann(m-1,ackermann(m,n-1)); [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, ackermann(m-1,1)=3, m=2, n=0] [L19] return ackermann(m-1,1); [L39] RET, EXPR ackermann(m,n) VAL [ackermann(m,n)=3, m=2, n=0] [L39] int result = ackermann(m,n); [L40] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L43] __VERIFIER_error() VAL [m=2, n=0, result=3] ----- [2018-11-23 00:41:48,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:41:48 BoogieIcfgContainer [2018-11-23 00:41:48,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:41:48,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:41:48,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:41:48,650 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:41:48,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:47" (3/4) ... [2018-11-23 00:41:48,653 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 #40#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~m~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=2] [?] assume !(~m~0 < 0 || ~m~0 > 3);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~m~0=2, main_~n~0=0] [?] assume !(~n~0 < 0 || ~n~0 > 23); VAL [main_~m~0=2, main_~n~0=0] [?] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [|ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] assume !(0 == ~m); VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] assume 0 == ~n; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0] [?] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [|ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] assume !(0 == ~m); VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] assume !(0 == ~n); VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1] [?] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [|ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] assume !(0 == ~m); VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] assume 0 == ~n; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0] [?] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [|ackermann_#in~m|=0, |ackermann_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1] [?] assume 0 == ~m;#res := 1 + ~n; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1, |ackermann_#res|=2] [?] assume true; VAL [ackermann_~m=0, ackermann_~n=1, |ackermann_#in~m|=0, |ackermann_#in~n|=1, |ackermann_#res|=2] [?] RET #44#return; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#res|=2] [?] assume true; VAL [ackermann_~m=1, ackermann_~n=0, |ackermann_#in~m|=1, |ackermann_#in~n|=0, |ackermann_#res|=2] [?] RET #46#return; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2] [?] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [|ackermann_#in~m|=0, |ackermann_#in~n|=2] [?] ~m := #in~m;~n := #in~n; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2] [?] assume 0 == ~m;#res := 1 + ~n; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=0, ackermann_~n=2, |ackermann_#in~m|=0, |ackermann_#in~n|=2, |ackermann_#res|=3] [?] RET #48#return; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#t~ret1|=2, |ackermann_#t~ret2|=3] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=1, ackermann_~n=1, |ackermann_#in~m|=1, |ackermann_#in~n|=1, |ackermann_#res|=3] [?] RET #44#return; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#res|=3] [?] assume true; VAL [ackermann_~m=2, ackermann_~n=0, |ackermann_#in~m|=2, |ackermann_#in~n|=0, |ackermann_#res|=3] [?] RET #50#return; VAL [main_~m~0=2, main_~n~0=0, |main_#t~ret5|=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~result~0 := #t~ret5;havoc #t~ret5; VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] assume !false; VAL [main_~m~0=2, main_~n~0=0, main_~result~0=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27-L31] assume !(~m~0 < 0 || ~m~0 > 3); [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33-L38] assume !(~n~0 < 0 || ~n~0 > 23); VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18-L20] assume !(0 == ~n); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L14-L22] ensures true; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L14-L22] ensures true; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L14-L22] ensures true; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L14-L22] ensures true; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L14-L22] ensures true; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40-L44] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27-L31] assume !(~m~0 < 0 || ~m~0 > 3); [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33-L38] assume !(~n~0 < 0 || ~n~0 > 23); VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18-L20] assume !(0 == ~n); VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15-L17] assume !(0 == ~m); VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18-L20] assume 0 == ~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L14-L22] ensures true; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L14-L22] ensures true; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15-L17] assume 0 == ~m; [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L14-L22] ensures true; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L14-L22] ensures true; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L14-L22] ensures true; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40-L44] assume !(~m~0 < 2 || ~result~0 >= 4); VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L26] ~m~0 := #t~nondet3; [L26] havoc #t~nondet3; VAL [~m~0=2] [L27] COND FALSE !(~m~0 < 0 || ~m~0 > 3) [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~n~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [~m~0=2, ~n~0=0] [L33] COND FALSE !(~n~0 < 0 || ~n~0 > 23) VAL [~m~0=2, ~n~0=0] [L39] CALL call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#in~m=2, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=2, #in~n=0, ~m=2, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L18] COND FALSE !(0 == ~n) VAL [#in~m=1, #in~n=1, ~m=1, ~n=1] [L21] CALL call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L15] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L18] COND TRUE 0 == ~n VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L19] CALL call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=0, #in~n=1] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=1, #res=2, ~m=0, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=1, #in~n=0, #t~ret0=2, ~m=1, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=1, #in~n=0, #res=2, ~m=1, ~n=0] [L21] RET call #t~ret1 := ackermann(~m, ~n - 1); VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1, #t~ret1=2, ~m=1, ~n=1] [L21] CALL call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=0, #in~n=2] [L14-L22] ~m := #in~m; [L14-L22] ~n := #in~n; VAL [#in~m=0, #in~n=2, ~m=0, ~n=2] [L15] COND TRUE 0 == ~m [L16] #res := 1 + ~n; VAL [#in~m=0, #in~n=2, #res=3, ~m=0, ~n=2] [L21] RET call #t~ret2 := ackermann(~m - 1, #t~ret1); VAL [#in~m=1, #in~n=1, #t~ret1=2, #t~ret2=3, ~m=1, ~n=1] [L21] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L21] #res := #t~ret2; [L21] havoc #t~ret2; [L21] havoc #t~ret1; VAL [#in~m=1, #in~n=1, #res=3, ~m=1, ~n=1] [L19] RET call #t~ret0 := ackermann(~m - 1, 1); VAL [#in~m=2, #in~n=0, #t~ret0=3, ~m=2, ~n=0] [L19] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L19] #res := #t~ret0; [L19] havoc #t~ret0; VAL [#in~m=2, #in~n=0, #res=3, ~m=2, ~n=0] [L39] RET call #t~ret5 := ackermann(~m~0, ~n~0); VAL [#t~ret5=3, ~m~0=2, ~n~0=0] [L39] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L39] ~result~0 := #t~ret5; [L39] havoc #t~ret5; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L40] COND FALSE !(~m~0 < 2 || ~result~0 >= 4) VAL [~m~0=2, ~n~0=0, ~result~0=3] [L43] assert false; VAL [~m~0=2, ~n~0=0, ~result~0=3] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0 || m > 3) [L32] int n = __VERIFIER_nondet_int(); [L33] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L39] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L18] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L18] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L21] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L18] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, ackermann(m-1,1)=2, m=1, n=0] [L19] return ackermann(m-1,1); [L21] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, m=1, n=1] [L21] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L21] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, ackermann(m-1,ackermann(m,n-1))=3, m=1, n=1] [L21] return ackermann(m-1,ackermann(m,n-1)); [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, ackermann(m-1,1)=3, m=2, n=0] [L19] return ackermann(m-1,1); [L39] RET, EXPR ackermann(m,n) VAL [ackermann(m,n)=3, m=2, n=0] [L39] int result = ackermann(m,n); [L40] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L43] __VERIFIER_error() VAL [m=2, n=0, result=3] ----- [2018-11-23 00:41:48,714 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_84450e04-c791-4a99-8f88-53665dc78b75/bin-2019/uautomizer/witness.graphml [2018-11-23 00:41:48,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:41:48,715 INFO L168 Benchmark]: Toolchain (without parser) took 1348.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 958.0 MB in the beginning and 1.0 GB in the end (delta: -43.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:48,716 INFO L168 Benchmark]: CDTParser took 0.11 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 00:41:48,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:48,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.15 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 00:41:48,717 INFO L168 Benchmark]: Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:41:48,717 INFO L168 Benchmark]: RCFGBuilder took 196.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:48,718 INFO L168 Benchmark]: TraceAbstraction took 904.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:48,718 INFO L168 Benchmark]: Witness Printer took 64.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:48,720 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.11 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 148.77 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.15 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.96 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 196.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 904.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0 || m > 3) [L32] int n = __VERIFIER_nondet_int(); [L33] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L39] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L18] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L18] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L21] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L15] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L18] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L19] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, ackermann(m-1,1)=2, m=1, n=0] [L19] return ackermann(m-1,1); [L21] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, m=1, n=1] [L21] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L15] COND TRUE m==0 [L16] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L21] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, ackermann(m,n-1)=2, ackermann(m-1,ackermann(m,n-1))=3, m=1, n=1] [L21] return ackermann(m-1,ackermann(m,n-1)); [L19] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, ackermann(m-1,1)=3, m=2, n=0] [L19] return ackermann(m-1,1); [L39] RET, EXPR ackermann(m,n) VAL [ackermann(m,n)=3, m=2, n=0] [L39] int result = ackermann(m,n); [L40] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L43] __VERIFIER_error() VAL [m=2, n=0, result=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 42 SDslu, 156 SDs, 0 SdLazy, 136 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 4382 SizeOfPredicates, 4 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 31/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...