./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex2_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex2_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/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 64bit --witnessprinter.graph.data.programhash f1df70d37f8afdd882c0c58eaed03ed11e314407 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 16:01:25,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 16:01:25,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 16:01:25,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 16:01:25,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 16:01:25,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 16:01:25,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 16:01:25,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 16:01:25,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 16:01:25,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 16:01:25,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 16:01:25,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 16:01:25,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 16:01:25,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 16:01:25,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 16:01:25,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 16:01:25,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 16:01:25,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 16:01:25,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 16:01:25,408 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 16:01:25,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 16:01:25,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 16:01:25,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 16:01:25,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 16:01:25,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 16:01:25,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 16:01:25,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 16:01:25,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 16:01:25,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 16:01:25,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 16:01:25,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 16:01:25,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 16:01:25,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 16:01:25,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 16:01:25,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 16:01:25,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 16:01:25,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 16:01:25,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 16:01:25,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 16:01:25,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 16:01:25,428 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 16:01:25,429 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 16:01:25,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 16:01:25,429 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 16:01:25,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 16:01:25,429 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 16:01:25,429 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 16:01:25,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 16:01:25,430 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 16:01:25,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 16:01:25,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 16:01:25,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 16:01:25,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 16:01:25,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 16:01:25,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 16:01:25,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 16:01:25,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 16:01:25,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 16:01:25,434 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_9a958c1a-7d79-4d29-8987-e3163c2d4f61/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1df70d37f8afdd882c0c58eaed03ed11e314407 [2018-11-23 16:01:25,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 16:01:25,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 16:01:25,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 16:01:25,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 16:01:25,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 16:01:25,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex2_false-no-overflow.c [2018-11-23 16:01:25,516 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/data/769f3e3dd/3ff888a7c35b4133a2201b3c59a70099/FLAGf636bf2d0 [2018-11-23 16:01:25,910 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 16:01:25,911 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex2_false-no-overflow.c [2018-11-23 16:01:25,914 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/data/769f3e3dd/3ff888a7c35b4133a2201b3c59a70099/FLAGf636bf2d0 [2018-11-23 16:01:25,924 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/data/769f3e3dd/3ff888a7c35b4133a2201b3c59a70099 [2018-11-23 16:01:25,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 16:01:25,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 16:01:25,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 16:01:25,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 16:01:25,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 16:01:25,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:01:25" (1/1) ... [2018-11-23 16:01:25,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d13f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:25, skipping insertion in model container [2018-11-23 16:01:25,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:01:25" (1/1) ... [2018-11-23 16:01:25,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 16:01:25,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 16:01:26,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:01:26,050 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 16:01:26,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:01:26,071 INFO L195 MainTranslator]: Completed translation [2018-11-23 16:01:26,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26 WrapperNode [2018-11-23 16:01:26,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 16:01:26,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 16:01:26,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 16:01:26,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 16:01:26,077 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:01:26" (1/1) ... [2018-11-23 16:01:26,080 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:01:26" (1/1) ... [2018-11-23 16:01:26,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 16:01:26,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 16:01:26,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 16:01:26,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 16:01:26,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... [2018-11-23 16:01:26,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 16:01:26,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 16:01:26,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 16:01:26,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 16:01:26,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/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 16:01:26,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 16:01:26,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 16:01:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 16:01:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 16:01:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 16:01:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 16:01:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 16:01:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 16:01:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 16:01:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 16:01:26,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 16:01:26,302 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 16:01:26,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:01:26 BoogieIcfgContainer [2018-11-23 16:01:26,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 16:01:26,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 16:01:26,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 16:01:26,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 16:01:26,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:01:25" (1/3) ... [2018-11-23 16:01:26,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e5285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:01:26, skipping insertion in model container [2018-11-23 16:01:26,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:01:26" (2/3) ... [2018-11-23 16:01:26,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5e5285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:01:26, skipping insertion in model container [2018-11-23 16:01:26,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:01:26" (3/3) ... [2018-11-23 16:01:26,310 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex2_false-no-overflow.c [2018-11-23 16:01:26,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 16:01:26,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 16:01:26,345 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 16:01:26,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 16:01:26,375 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 16:01:26,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 16:01:26,375 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 16:01:26,375 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 16:01:26,375 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 16:01:26,375 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 16:01:26,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 16:01:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 16:01:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 16:01:26,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:01:26,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:01:26,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 16:01:26,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:01:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1431844715, now seen corresponding path program 1 times [2018-11-23 16:01:26,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 16:01:26,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:01:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 16:01:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:01:26,539 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 16:01:26,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 16:01:26,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 16:01:26,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 16:01:26,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 16:01:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 16:01:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 16:01:26,553 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-11-23 16:01:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:01:26,622 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 16:01:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 16:01:26,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 16:01:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:01:26,630 INFO L225 Difference]: With dead ends: 44 [2018-11-23 16:01:26,630 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 16:01:26,632 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 16:01:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 16:01:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 16:01:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 16:01:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 16:01:26,656 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2018-11-23 16:01:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:01:26,657 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 16:01:26,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 16:01:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 16:01:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 16:01:26,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:01:26,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:01:26,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 16:01:26,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:01:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1437513166, now seen corresponding path program 1 times [2018-11-23 16:01:26,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 16:01:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:01:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 16:01:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:01:26,710 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 16:01:26,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 16:01:26,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 16:01:26,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 16:01:26,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 16:01:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 16:01:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 16:01:26,712 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-11-23 16:01:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 16:01:26,752 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 16:01:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 16:01:26,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 16:01:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 16:01:26,753 INFO L225 Difference]: With dead ends: 26 [2018-11-23 16:01:26,753 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 16:01:26,754 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 16:01:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 16:01:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 16:01:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 16:01:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 16:01:26,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2018-11-23 16:01:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 16:01:26,758 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 16:01:26,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 16:01:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 16:01:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 16:01:26,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 16:01:26,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 16:01:26,759 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 16:01:26,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:01:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash 164243953, now seen corresponding path program 1 times [2018-11-23 16:01:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 16:01:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 16:01:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 16:01:26,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 16:01:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:01:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:01:26,794 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~x~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=1, main_~x~0=2147483647] [?] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [main_~i~0=1, main_~x~0=2147483647] [?] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [|f_#in~i|=1, |f_#in~x|=2147483647] [?] ~i := #in~i;~x := #in~x; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume !(0 == ~i); VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume ~i - 1 <= 2147483647; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume ~i - 1 >= -2147483648; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [|g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] ~a := #in~a;~b := #in~b;~c := #in~c; VAL [g_~a=0, g_~b=2147483647, g_~c=1, |g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] assume !(~b + ~c <= 2147483647); VAL [g_~a=0, g_~b=2147483647, g_~c=1, |g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32-L34] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18-L22] assume !(0 == ~i); VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=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(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32-L34] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18-L22] assume !(0 == ~i); VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L30] int i = __VERIFIER_nondet_int(); [L31] int x = __VERIFIER_nondet_int(); [L32] COND TRUE i >= 0 && x >= 0 VAL [i=1, x=2147483647] [L33] CALL f(i,x) VAL [\old(i)=1, \old(x)=2147483647] [L18] COND FALSE !(i==0) VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] EXPR i-1 VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] CALL g(i-1,x,i) VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1] [L26] b+c VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1, a=0, b=2147483647, c=1] ----- [2018-11-23 16:01:26,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:01:26 BoogieIcfgContainer [2018-11-23 16:01:26,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 16:01:26,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 16:01:26,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 16:01:26,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 16:01:26,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:01:26" (3/4) ... [2018-11-23 16:01:26,825 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #40#return; [?] CALL call #t~ret5 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~x~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=1, main_~x~0=2147483647] [?] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [main_~i~0=1, main_~x~0=2147483647] [?] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [|f_#in~i|=1, |f_#in~x|=2147483647] [?] ~i := #in~i;~x := #in~x; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume !(0 == ~i); VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume ~i - 1 <= 2147483647; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] assume ~i - 1 >= -2147483648; VAL [f_~i=1, f_~x=2147483647, |f_#in~i|=1, |f_#in~x|=2147483647] [?] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [|g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] ~a := #in~a;~b := #in~b;~c := #in~c; VAL [g_~a=0, g_~b=2147483647, g_~c=1, |g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] assume !(~b + ~c <= 2147483647); VAL [g_~a=0, g_~b=2147483647, g_~c=1, |g_#in~a|=0, |g_#in~b|=2147483647, |g_#in~c|=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32-L34] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18-L22] assume !(0 == ~i); VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=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(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32-L34] assume ~i~0 >= 0 && ~x~0 >= 0; VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18-L22] assume !(0 == ~i); VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L30] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L30] ~i~0 := #t~nondet2; [L30] havoc #t~nondet2; [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~x~0 := #t~nondet3; [L31] havoc #t~nondet3; VAL [~i~0=1, ~x~0=2147483647] [L32] COND TRUE ~i~0 >= 0 && ~x~0 >= 0 VAL [~i~0=1, ~x~0=2147483647] [L33] CALL call #t~ret4 := f(~i~0, ~x~0); VAL [#in~i=1, #in~x=2147483647] [L17-L23] ~i := #in~i; [L17-L23] ~x := #in~x; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L18] COND FALSE !(0 == ~i) VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 <= 2147483647; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] assert ~i - 1 >= -2147483648; VAL [#in~i=1, #in~x=2147483647, ~i=1, ~x=2147483647] [L21] CALL call #t~ret0 := g(~i - 1, ~x, ~i); VAL [#in~a=0, #in~b=2147483647, #in~c=1] [L25-L27] ~a := #in~a; [L25-L27] ~b := #in~b; [L25-L27] ~c := #in~c; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L26] assert ~b + ~c <= 2147483647; VAL [#in~a=0, #in~b=2147483647, #in~c=1, ~a=0, ~b=2147483647, ~c=1] [L30] int i = __VERIFIER_nondet_int(); [L31] int x = __VERIFIER_nondet_int(); [L32] COND TRUE i >= 0 && x >= 0 VAL [i=1, x=2147483647] [L33] CALL f(i,x) VAL [\old(i)=1, \old(x)=2147483647] [L18] COND FALSE !(i==0) VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] EXPR i-1 VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] CALL g(i-1,x,i) VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1] [L26] b+c VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1, a=0, b=2147483647, c=1] ----- [2018-11-23 16:01:26,861 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a958c1a-7d79-4d29-8987-e3163c2d4f61/bin-2019/utaipan/witness.graphml [2018-11-23 16:01:26,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 16:01:26,862 INFO L168 Benchmark]: Toolchain (without parser) took 936.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -98.5 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,863 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:01:26,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.00 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:01:26,864 INFO L168 Benchmark]: Boogie Preprocessor took 11.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,864 INFO L168 Benchmark]: RCFGBuilder took 206.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,865 INFO L168 Benchmark]: TraceAbstraction took 519.86 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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,865 INFO L168 Benchmark]: Witness Printer took 38.69 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:01:26,868 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.06 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 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.00 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 519.86 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: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Witness Printer took 38.69 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: integer overflow possible integer overflow possible We found a FailurePath: [L30] int i = __VERIFIER_nondet_int(); [L31] int x = __VERIFIER_nondet_int(); [L32] COND TRUE i >= 0 && x >= 0 VAL [i=1, x=2147483647] [L33] CALL f(i,x) VAL [\old(i)=1, \old(x)=2147483647] [L18] COND FALSE !(i==0) VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] EXPR i-1 VAL [\old(i)=1, \old(x)=2147483647, i=1, x=2147483647] [L21] CALL g(i-1,x,i) VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1] [L26] b+c VAL [\old(a)=0, \old(b)=2147483647, \old(c)=1, a=0, b=2147483647, c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 4 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 24 SDslu, 119 SDs, 0 SdLazy, 44 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...