./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Addition03_false-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Addition03_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dddcb69df051b3342ff5d327b07dc16715e4d058 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:05:38,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:05:38,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:05:38,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:05:38,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:05:38,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:05:38,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:05:38,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:05:38,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:05:38,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:05:38,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:05:38,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:05:38,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:05:38,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:05:38,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:05:38,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:05:38,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:05:38,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:05:38,813 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:05:38,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:05:38,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:05:38,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:05:38,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:05:38,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:05:38,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:05:38,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:05:38,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:05:38,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:05:38,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:05:38,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:05:38,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:05:38,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:05:38,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:05:38,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:05:38,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:05:38,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:05:38,823 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-23 04:05:38,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:05:38,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:05:38,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:05:38,834 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:05:38,835 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:05:38,835 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:05:38,836 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:05:38,836 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:05:38,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:05:38,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:05:38,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:05:38,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:05:38,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:05:38,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:05:38,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:05:38,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:05:38,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:05:38,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:05:38,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:05:38,840 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:05:38,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:05:38,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:05:38,840 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:05:38,840 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dddcb69df051b3342ff5d327b07dc16715e4d058 [2018-11-23 04:05:38,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:05:38,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:05:38,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:05:38,872 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:05:38,872 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:05:38,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Addition03_false-no-overflow.c [2018-11-23 04:05:38,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/data/f8ba50470/37edd8dc482c4ddaa0065fd880a9157a/FLAG3ba4f1ba8 [2018-11-23 04:05:39,306 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:05:39,306 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/sv-benchmarks/c/recursive/Addition03_false-no-overflow.c [2018-11-23 04:05:39,310 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/data/f8ba50470/37edd8dc482c4ddaa0065fd880a9157a/FLAG3ba4f1ba8 [2018-11-23 04:05:39,321 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/data/f8ba50470/37edd8dc482c4ddaa0065fd880a9157a [2018-11-23 04:05:39,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:05:39,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:05:39,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:05:39,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:05:39,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:05:39,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,329 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 04:05:39, skipping insertion in model container [2018-11-23 04:05:39,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:05:39,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:05:39,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:05:39,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:05:39,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:05:39,463 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:05:39,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39 WrapperNode [2018-11-23 04:05:39,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:05:39,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:05:39,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:05:39,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:05:39,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:05:39,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:05:39,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:05:39,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:05:39,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... [2018-11-23 04:05:39,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:05:39,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:05:39,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:05:39,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:05:39,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:05:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:05:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:05:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:05:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:05:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:05:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:05:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2018-11-23 04:05:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2018-11-23 04:05:39,712 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:05:39,712 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 04:05:39,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:05:39 BoogieIcfgContainer [2018-11-23 04:05:39,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:05:39,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:05:39,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:05:39,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:05:39,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:05:39" (1/3) ... [2018-11-23 04:05:39,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ed3816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:05:39, skipping insertion in model container [2018-11-23 04:05:39,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:05:39" (2/3) ... [2018-11-23 04:05:39,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ed3816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:05:39, skipping insertion in model container [2018-11-23 04:05:39,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:05:39" (3/3) ... [2018-11-23 04:05:39,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition03_false-no-overflow.c [2018-11-23 04:05:39,724 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:05:39,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-23 04:05:39,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-23 04:05:39,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:05:39,771 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:05:39,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:05:39,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:05:39,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:05:39,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:05:39,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:05:39,772 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:05:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 04:05:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 04:05:39,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:05:39,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:05:39,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:05:39,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:05:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1552818681, now seen corresponding path program 1 times [2018-11-23 04:05:39,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:05:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:05:39,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:05:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:05:39,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:05:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:05:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:05:39,881 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #49#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [?] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [|addition_#in~m|=2147483647, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(1 + ~m <= 2147483647); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] int m = __VERIFIER_nondet_int(); [L28] int n = __VERIFIER_nondet_int(); [L29] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] ----- [2018-11-23 04:05:39,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:05:39 BoogieIcfgContainer [2018-11-23 04:05:39,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:05:39,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:05:39,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:05:39,912 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:05:39,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:05:39" (3/4) ... [2018-11-23 04:05:39,915 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 #49#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [?] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [|addition_#in~m|=2147483647, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(1 + ~m <= 2147483647); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=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; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~n~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~m~0=2147483647, ~n~0=1] [L29] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] int m = __VERIFIER_nondet_int(); [L28] int n = __VERIFIER_nondet_int(); [L29] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] ----- [2018-11-23 04:05:39,942 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c9e796e9-9a2d-4d69-8a76-e3fca9d4d1d5/bin-2019/utaipan/witness.graphml [2018-11-23 04:05:39,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:05:39,943 INFO L168 Benchmark]: Toolchain (without parser) took 619.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -129.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:05:39,944 INFO L168 Benchmark]: CDTParser took 0.12 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 04:05:39,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:05:39,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.32 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:05:39,945 INFO L168 Benchmark]: Boogie Preprocessor took 11.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:05:39,946 INFO L168 Benchmark]: RCFGBuilder took 224.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:05:39,946 INFO L168 Benchmark]: TraceAbstraction took 198.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:05:39,947 INFO L168 Benchmark]: Witness Printer took 31.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:05:39,950 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.32 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Witness Printer took 31.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 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: 18]: integer overflow possible integer overflow possible We found a FailurePath: [L27] int m = __VERIFIER_nondet_int(); [L28] int n = __VERIFIER_nondet_int(); [L29] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 8 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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...