./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/EvenOdd03WithOverflowBug_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_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd03WithOverflowBug_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/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 1c7eaf6fd654eb823cca8af53b20b25aebb12776 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 08:58:15,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:58:15,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:58:15,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:58:15,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:58:15,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:58:15,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:58:15,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:58:15,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:58:15,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:58:15,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:58:15,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:58:15,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:58:15,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:58:15,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:58:15,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:58:15,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:58:15,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:58:15,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:58:15,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:58:15,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:58:15,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:58:15,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:58:15,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:58:15,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:58:15,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:58:15,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:58:15,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:58:15,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:58:15,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:58:15,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:58:15,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:58:15,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:58:15,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:58:15,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:58:15,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:58:15,186 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-23 08:58:15,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:58:15,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:58:15,196 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:58:15,197 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:58:15,197 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:58:15,198 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:58:15,198 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:58:15,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:58:15,198 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:58:15,198 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:58:15,199 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:58:15,200 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:58:15,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:58:15,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:58:15,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:58:15,202 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:58:15,202 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_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/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 -> 1c7eaf6fd654eb823cca8af53b20b25aebb12776 [2018-11-23 08:58:15,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:58:15,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:58:15,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:58:15,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:58:15,239 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:58:15,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/../../sv-benchmarks/c/recursive/EvenOdd03WithOverflowBug_false-no-overflow.c [2018-11-23 08:58:15,279 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/data/45d799ae4/179cc085ceb44a7a8b5f7535ccd597a6/FLAGaaa38bfdc [2018-11-23 08:58:15,613 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:58:15,613 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/sv-benchmarks/c/recursive/EvenOdd03WithOverflowBug_false-no-overflow.c [2018-11-23 08:58:15,617 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/data/45d799ae4/179cc085ceb44a7a8b5f7535ccd597a6/FLAGaaa38bfdc [2018-11-23 08:58:16,046 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/data/45d799ae4/179cc085ceb44a7a8b5f7535ccd597a6 [2018-11-23 08:58:16,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:58:16,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:58:16,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:58:16,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:58:16,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:58:16,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a197f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16, skipping insertion in model container [2018-11-23 08:58:16,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:58:16,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:58:16,191 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:58:16,194 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:58:16,203 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:58:16,211 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:58:16,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16 WrapperNode [2018-11-23 08:58:16,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:58:16,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:58:16,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:58:16,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:58:16,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:58:16,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:58:16,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:58:16,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:58:16,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... [2018-11-23 08:58:16,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:58:16,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:58:16,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:58:16,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:58:16,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/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 08:58:16,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:58:16,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:58:16,315 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-11-23 08:58:16,315 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-11-23 08:58:16,315 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-11-23 08:58:16,315 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-11-23 08:58:16,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:58:16,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:58:16,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:58:16,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:58:16,442 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:58:16,442 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 08:58:16,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:58:16 BoogieIcfgContainer [2018-11-23 08:58:16,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:58:16,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:58:16,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:58:16,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:58:16,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:58:16" (1/3) ... [2018-11-23 08:58:16,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22acbdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:58:16, skipping insertion in model container [2018-11-23 08:58:16,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:58:16" (2/3) ... [2018-11-23 08:58:16,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22acbdbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:58:16, skipping insertion in model container [2018-11-23 08:58:16,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:58:16" (3/3) ... [2018-11-23 08:58:16,450 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd03WithOverflowBug_false-no-overflow.c [2018-11-23 08:58:16,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:58:16,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 08:58:16,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 08:58:16,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:58:16,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:58:16,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:58:16,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:58:16,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:58:16,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:58:16,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:58:16,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:58:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 08:58:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:58:16,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:16,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:16,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:58:16,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -62605241, now seen corresponding path program 1 times [2018-11-23 08:58:16,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:58:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:16,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:16,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:16,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:58:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:16,648 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 08:58:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:58:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 08:58:16,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:58:16,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:58:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:58:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:58:16,665 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 5 states. [2018-11-23 08:58:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:16,735 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 08:58:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 08:58:16,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 08:58:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:16,742 INFO L225 Difference]: With dead ends: 52 [2018-11-23 08:58:16,742 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 08:58:16,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:58:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 08:58:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-23 08:58:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 08:58:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 08:58:16,768 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 10 [2018-11-23 08:58:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:16,768 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 08:58:16,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:58:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 08:58:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 08:58:16,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:16,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:16,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 08:58:16,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1940762428, now seen corresponding path program 1 times [2018-11-23 08:58:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:58:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:16,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:16,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:58:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:58:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:58:16,800 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #51#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=(- 2147483648)] [?] CALL call #t~ret3 := isEven(~n~0); VAL [|isEven_#in~n|=(- 2147483648)] [?] ~n := #in~n; VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(0 == ~n); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(1 == ~n); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume ~n - 1 <= 2147483647; VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(~n - 1 >= -2147483648); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27-L33] assume !(0 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L29-L33] assume !(1 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27-L33] assume !(0 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L29-L33] assume !(1 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [L38] int n = __VERIFIER_nondet_int(); [L39] CALL isEven(n) VAL [\old(n)=-2147483648] [L27] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648] [L29] COND FALSE !(n == 1) VAL [\old(n)=-2147483648, n=-2147483648] [L32] n - 1 VAL [\old(n)=-2147483648, n=-2147483648] ----- [2018-11-23 08:58:16,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:58:16 BoogieIcfgContainer [2018-11-23 08:58:16,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:58:16,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:58:16,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:58:16,820 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:58:16,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:58:16" (3/4) ... [2018-11-23 08:58:16,822 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 #51#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=(- 2147483648)] [?] CALL call #t~ret3 := isEven(~n~0); VAL [|isEven_#in~n|=(- 2147483648)] [?] ~n := #in~n; VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(0 == ~n); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(1 == ~n); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume ~n - 1 <= 2147483647; VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] assume !(~n - 1 >= -2147483648); VAL [isEven_~n=(- 2147483648), |isEven_#in~n|=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27-L33] assume !(0 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L29-L33] assume !(1 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27-L33] assume !(0 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L29-L33] assume !(1 == ~n); VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L38] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L38] ~n~0 := #t~nondet2; [L38] havoc #t~nondet2; VAL [~n~0=-2147483648] [L39] CALL call #t~ret3 := isEven(~n~0); VAL [#in~n=-2147483648] [L26-L34] ~n := #in~n; VAL [#in~n=-2147483648, ~n=-2147483648] [L27] COND FALSE !(0 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L29] COND FALSE !(1 == ~n) VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 <= 2147483647; VAL [#in~n=-2147483648, ~n=-2147483648] [L32] assert ~n - 1 >= -2147483648; VAL [#in~n=-2147483648, ~n=-2147483648] [L38] int n = __VERIFIER_nondet_int(); [L39] CALL isEven(n) VAL [\old(n)=-2147483648] [L27] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648] [L29] COND FALSE !(n == 1) VAL [\old(n)=-2147483648, n=-2147483648] [L32] n - 1 VAL [\old(n)=-2147483648, n=-2147483648] ----- [2018-11-23 08:58:16,852 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c26d1e18-c8f6-425f-8dcc-8b2d7743cdaf/bin-2019/utaipan/witness.graphml [2018-11-23 08:58:16,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:58:16,853 INFO L168 Benchmark]: Toolchain (without parser) took 803.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.1 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:58:16,854 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:58:16,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:58:16,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:58:16,855 INFO L168 Benchmark]: Boogie Preprocessor took 12.14 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:58:16,855 INFO L168 Benchmark]: RCFGBuilder took 205.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:58:16,855 INFO L168 Benchmark]: TraceAbstraction took 375.61 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:58:16,856 INFO L168 Benchmark]: Witness Printer took 32.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:58:16,858 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 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.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.14 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 375.61 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Witness Printer took 32.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 32]: integer overflow possible integer overflow possible We found a FailurePath: [L38] int n = __VERIFIER_nondet_int(); [L39] CALL isEven(n) VAL [\old(n)=-2147483648] [L27] COND FALSE !(n == 0) VAL [\old(n)=-2147483648, n=-2147483648] [L29] COND FALSE !(n == 1) VAL [\old(n)=-2147483648, n=-2147483648] [L32] n - 1 VAL [\old(n)=-2147483648, n=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 22 SDslu, 88 SDs, 0 SdLazy, 30 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...