./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Addition02_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_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Addition02_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/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 4f9a38be18608b9918f157c72437435dc654871f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 07:38:37,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:38:37,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:38:37,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:38:37,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:38:37,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:38:37,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:38:37,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:38:37,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:38:37,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:38:37,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:38:37,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:38:37,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:38:37,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:38:37,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:38:37,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:38:37,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:38:37,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:38:37,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:38:37,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:38:37,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:38:37,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:38:37,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:38:37,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:38:37,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:38:37,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:38:37,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:38:37,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:38:37,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:38:37,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:38:37,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:38:37,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:38:37,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:38:37,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:38:37,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:38:37,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:38:37,922 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:38:37,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:38:37,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:38:37,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:38:37,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:38:37,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:38:37,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:38:37,933 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:38:37,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:38:37,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:38:37,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:38:37,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:38:37,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:38:37,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:38:37,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:38:37,935 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_c13b08a0-e19c-4100-99e1-8801b78a29a9/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 -> 4f9a38be18608b9918f157c72437435dc654871f [2018-11-23 07:38:37,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:38:37,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:38:37,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:38:37,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:38:37,969 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:38:37,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Addition02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:38:38,007 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/data/f7ae98ee2/8460a8e9577a42a294360823e986e0cb/FLAG8964d56ef [2018-11-23 07:38:38,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:38:38,411 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/sv-benchmarks/c/recursive/Addition02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:38:38,416 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/data/f7ae98ee2/8460a8e9577a42a294360823e986e0cb/FLAG8964d56ef [2018-11-23 07:38:38,428 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/data/f7ae98ee2/8460a8e9577a42a294360823e986e0cb [2018-11-23 07:38:38,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:38:38,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:38:38,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:38:38,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:38:38,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:38:38,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38, skipping insertion in model container [2018-11-23 07:38:38,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:38:38,457 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:38:38,569 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:38:38,571 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:38:38,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:38:38,593 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:38:38,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38 WrapperNode [2018-11-23 07:38:38,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:38:38,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:38:38,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:38:38,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:38:38,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:38:38,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:38:38,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:38:38,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:38:38,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... [2018-11-23 07:38:38,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:38:38,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:38:38,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:38:38,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:38:38,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/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 07:38:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:38:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:38:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:38:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:38:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:38:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:38:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2018-11-23 07:38:38,690 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2018-11-23 07:38:38,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:38:38,805 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 07:38:38,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:38:38 BoogieIcfgContainer [2018-11-23 07:38:38,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:38:38,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:38:38,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:38:38,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:38:38,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:38:38" (1/3) ... [2018-11-23 07:38:38,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78187512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:38:38, skipping insertion in model container [2018-11-23 07:38:38,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:38:38" (2/3) ... [2018-11-23 07:38:38,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78187512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:38:38, skipping insertion in model container [2018-11-23 07:38:38,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:38:38" (3/3) ... [2018-11-23 07:38:38,812 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition02_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:38:38,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:38:38,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:38:38,839 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:38:38,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:38:38,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:38:38,864 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:38:38,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:38:38,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:38:38,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:38:38,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:38:38,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:38:38,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:38:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 07:38:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:38:38,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:38:38,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:38:38,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:38:38,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:38:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -854965079, now seen corresponding path program 1 times [2018-11-23 07:38:38,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:38:38,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:38:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:38,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:38:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:39,092 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 07:38:39,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:38:39,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:38:39,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:38:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:38:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:38:39,112 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2018-11-23 07:38:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:38:39,270 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 07:38:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:38:39,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 07:38:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:38:39,278 INFO L225 Difference]: With dead ends: 38 [2018-11-23 07:38:39,278 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 07:38:39,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:38:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 07:38:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 07:38:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 07:38:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-23 07:38:39,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2018-11-23 07:38:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:38:39,312 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 07:38:39,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:38:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-23 07:38:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 07:38:39,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:38:39,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:38:39,313 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:38:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:38:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1632999070, now seen corresponding path program 1 times [2018-11-23 07:38:39,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:38:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:38:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:38:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:39,347 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 07:38:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:38:39,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:38:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:38:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:38:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:38:39,349 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 4 states. [2018-11-23 07:38:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:38:39,367 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-23 07:38:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:38:39,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 07:38:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:38:39,368 INFO L225 Difference]: With dead ends: 34 [2018-11-23 07:38:39,368 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 07:38:39,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:38:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 07:38:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 07:38:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 07:38:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 07:38:39,374 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2018-11-23 07:38:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:38:39,374 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 07:38:39,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:38:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 07:38:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:38:39,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:38:39,375 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 07:38:39,375 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:38:39,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:38:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1746800232, now seen corresponding path program 1 times [2018-11-23 07:38:39,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:38:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:38:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:38:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:38:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:38:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:38:39,409 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #42#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=0] [?] assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=0, main_~n~0=1] [?] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [main_~m~0=0, main_~n~0=1] [?] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [|addition_#in~m|=0, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [|addition_#in~m|=1, |addition_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0] [?] assume 0 == ~n;#res := ~m; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0, |addition_#res|=1] [?] assume true; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0, |addition_#res|=1] [?] RET #48#return; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#res|=1] [?] assume true; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#res|=1] [?] RET #46#return; VAL [main_~m~0=0, main_~n~0=1, |main_#t~ret4|=1] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] assume !(~result~0 == ~m~0 - ~n~0); VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] assume !false; VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28-L32] assume !(~m~0 < 0 || ~m~0 > 1073741823); [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34-L38] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14-L16] assume 0 == ~n; [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L13-L23] ensures true; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L13-L23] ensures true; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40-L44] assume !(~result~0 == ~m~0 - ~n~0); VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28-L32] assume !(~m~0 < 0 || ~m~0 > 1073741823); [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34-L38] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14-L16] assume 0 == ~n; [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L13-L23] ensures true; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L13-L23] ensures true; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40-L44] assume !(~result~0 == ~m~0 - ~n~0); VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m < 0 || m > 1073741823) [L33] int n = __VERIFIER_nondet_int(); [L34] COND FALSE !(n < 0 || n > 1073741823) VAL [m=0, n=1] [L39] CALL, EXPR addition(m,n) VAL [\old(m)=0, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L18] CALL, EXPR addition(m+1, n-1) VAL [\old(m)=1, \old(n)=0] [L14] COND TRUE n == 0 [L15] return m; VAL [\old(m)=1, \old(n)=0, \result=1, m=1, n=0] [L18] RET, EXPR addition(m+1, n-1) VAL [\old(m)=0, \old(n)=1, addition(m+1, n-1)=1, m=0, n=1] [L18] return addition(m+1, n-1); [L39] RET, EXPR addition(m,n) VAL [addition(m,n)=1, m=0, n=1] [L39] int result = addition(m,n); [L40] COND FALSE !(result == m - n) VAL [m=0, n=1, result=1] [L43] __VERIFIER_error() VAL [m=0, n=1, result=1] ----- [2018-11-23 07:38:39,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:38:39 BoogieIcfgContainer [2018-11-23 07:38:39,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:38:39,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:38:39,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:38:39,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:38:39,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:38:38" (3/4) ... [2018-11-23 07:38:39,443 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 #42#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=0] [?] assume !(~m~0 < 0 || ~m~0 > 1073741823);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=0, main_~n~0=1] [?] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [main_~m~0=0, main_~n~0=1] [?] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [|addition_#in~m|=0, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1] [?] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [|addition_#in~m|=1, |addition_#in~n|=0] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0] [?] assume 0 == ~n;#res := ~m; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0, |addition_#res|=1] [?] assume true; VAL [addition_~m=1, addition_~n=0, |addition_#in~m|=1, |addition_#in~n|=0, |addition_#res|=1] [?] RET #48#return; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#res|=1] [?] assume true; VAL [addition_~m=0, addition_~n=1, |addition_#in~m|=0, |addition_#in~n|=1, |addition_#res|=1] [?] RET #46#return; VAL [main_~m~0=0, main_~n~0=1, |main_#t~ret4|=1] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] assume !(~result~0 == ~m~0 - ~n~0); VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] assume !false; VAL [main_~m~0=0, main_~n~0=1, main_~result~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28-L32] assume !(~m~0 < 0 || ~m~0 > 1073741823); [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34-L38] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14-L16] assume 0 == ~n; [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L13-L23] ensures true; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L13-L23] ensures true; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40-L44] assume !(~result~0 == ~m~0 - ~n~0); VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28-L32] assume !(~m~0 < 0 || ~m~0 > 1073741823); [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34-L38] assume !(~n~0 < 0 || ~n~0 > 1073741823); VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14-L16] assume 0 == ~n; [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L13-L23] ensures true; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L13-L23] ensures true; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40-L44] assume !(~result~0 == ~m~0 - ~n~0); VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; VAL [~m~0=0] [L28] COND FALSE !(~m~0 < 0 || ~m~0 > 1073741823) [L33] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L33] ~n~0 := #t~nondet3; [L33] havoc #t~nondet3; VAL [~m~0=0, ~n~0=1] [L34] COND FALSE !(~n~0 < 0 || ~n~0 > 1073741823) VAL [~m~0=0, ~n~0=1] [L39] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=0, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=0, #in~n=1, ~m=0, ~n=1] [L18] CALL call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=1, #in~n=0] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=1, #in~n=0, ~m=1, ~n=0] [L14] COND TRUE 0 == ~n [L15] #res := ~m; VAL [#in~m=1, #in~n=0, #res=1, ~m=1, ~n=0] [L18] RET call #t~ret0 := addition(1 + ~m, ~n - 1); VAL [#in~m=0, #in~n=1, #t~ret0=1, ~m=0, ~n=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] #res := #t~ret0; [L18] havoc #t~ret0; VAL [#in~m=0, #in~n=1, #res=1, ~m=0, ~n=1] [L39] RET call #t~ret4 := addition(~m~0, ~n~0); VAL [#t~ret4=1, ~m~0=0, ~n~0=1] [L39] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L39] ~result~0 := #t~ret4; [L39] havoc #t~ret4; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L40] COND FALSE !(~result~0 == ~m~0 - ~n~0) VAL [~m~0=0, ~n~0=1, ~result~0=1] [L43] assert false; VAL [~m~0=0, ~n~0=1, ~result~0=1] [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m < 0 || m > 1073741823) [L33] int n = __VERIFIER_nondet_int(); [L34] COND FALSE !(n < 0 || n > 1073741823) VAL [m=0, n=1] [L39] CALL, EXPR addition(m,n) VAL [\old(m)=0, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L18] CALL, EXPR addition(m+1, n-1) VAL [\old(m)=1, \old(n)=0] [L14] COND TRUE n == 0 [L15] return m; VAL [\old(m)=1, \old(n)=0, \result=1, m=1, n=0] [L18] RET, EXPR addition(m+1, n-1) VAL [\old(m)=0, \old(n)=1, addition(m+1, n-1)=1, m=0, n=1] [L18] return addition(m+1, n-1); [L39] RET, EXPR addition(m,n) VAL [addition(m,n)=1, m=0, n=1] [L39] int result = addition(m,n); [L40] COND FALSE !(result == m - n) VAL [m=0, n=1, result=1] [L43] __VERIFIER_error() VAL [m=0, n=1, result=1] ----- [2018-11-23 07:38:39,477 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c13b08a0-e19c-4100-99e1-8801b78a29a9/bin-2019/uautomizer/witness.graphml [2018-11-23 07:38:39,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:38:39,478 INFO L168 Benchmark]: Toolchain (without parser) took 1047.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 959.3 MB in the beginning and 1.0 GB in the end (delta: -89.9 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,480 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:38:39,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,481 INFO L168 Benchmark]: Boogie Preprocessor took 11.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:38:39,481 INFO L168 Benchmark]: RCFGBuilder took 187.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,481 INFO L168 Benchmark]: TraceAbstraction took 633.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,481 INFO L168 Benchmark]: Witness Printer took 37.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:38:39,484 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.11 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 633.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. * Witness Printer took 37.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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: [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m < 0 || m > 1073741823) [L33] int n = __VERIFIER_nondet_int(); [L34] COND FALSE !(n < 0 || n > 1073741823) VAL [m=0, n=1] [L39] CALL, EXPR addition(m,n) VAL [\old(m)=0, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=0, \old(n)=1, m=0, n=1] [L18] CALL, EXPR addition(m+1, n-1) VAL [\old(m)=1, \old(n)=0] [L14] COND TRUE n == 0 [L15] return m; VAL [\old(m)=1, \old(n)=0, \result=1, m=1, n=0] [L18] RET, EXPR addition(m+1, n-1) VAL [\old(m)=0, \old(n)=1, addition(m+1, n-1)=1, m=0, n=1] [L18] return addition(m+1, n-1); [L39] RET, EXPR addition(m,n) VAL [addition(m,n)=1, m=0, n=1] [L39] int result = addition(m,n); [L40] COND FALSE !(result == m - n) VAL [m=0, n=1, result=1] [L43] __VERIFIER_error() VAL [m=0, n=1, result=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 27 SDslu, 93 SDs, 0 SdLazy, 95 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...