./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.09_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_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.09_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 84b0699039fdd709a3306cfa354f9fcc70db171e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:07:18,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:07:18,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:07:18,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:07:18,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:07:18,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:07:18,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:07:18,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:07:18,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:07:18,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:07:18,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:07:18,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:07:18,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:07:18,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:07:18,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:07:18,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:07:18,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:07:18,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:07:18,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:07:18,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:07:18,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:07:18,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:07:18,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:07:18,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:07:18,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:07:18,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:07:18,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:07:18,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:07:18,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:07:18,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:07:18,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:07:18,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:07:18,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:07:18,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:07:18,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:07:18,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:07:18,528 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 01:07:18,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:07:18,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:07:18,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:07:18,536 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:07:18,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:07:18,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:07:18,536 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:07:18,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:07:18,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:07:18,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:07:18,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:07:18,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:07:18,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:07:18,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:07:18,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:07:18,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84b0699039fdd709a3306cfa354f9fcc70db171e [2018-11-23 01:07:18,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:07:18,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:07:18,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:07:18,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:07:18,570 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:07:18,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.09_false-no-overflow.c [2018-11-23 01:07:18,615 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/data/55300f44c/f380fc2e0dc54d5ab213ef0bf0042baf/FLAG60443ff0f [2018-11-23 01:07:18,946 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:07:18,947 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.09_false-no-overflow.c [2018-11-23 01:07:18,951 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/data/55300f44c/f380fc2e0dc54d5ab213ef0bf0042baf/FLAG60443ff0f [2018-11-23 01:07:19,372 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/data/55300f44c/f380fc2e0dc54d5ab213ef0bf0042baf [2018-11-23 01:07:19,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:07:19,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:07:19,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:07:19,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:07:19,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:07:19,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a31ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19, skipping insertion in model container [2018-11-23 01:07:19,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:07:19,400 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:07:19,503 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:07:19,506 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:07:19,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:07:19,523 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:07:19,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19 WrapperNode [2018-11-23 01:07:19,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:07:19,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:07:19,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:07:19,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:07:19,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:07:19,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:07:19,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:07:19,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:07:19,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... [2018-11-23 01:07:19,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:07:19,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:07:19,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:07:19,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:07:19,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:07:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:07:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:07:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:07:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:07:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:07:19,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:07:19,719 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:07:19,719 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 01:07:19,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:07:19 BoogieIcfgContainer [2018-11-23 01:07:19,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:07:19,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:07:19,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:07:19,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:07:19,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:07:19" (1/3) ... [2018-11-23 01:07:19,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:07:19, skipping insertion in model container [2018-11-23 01:07:19,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:07:19" (2/3) ... [2018-11-23 01:07:19,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:07:19, skipping insertion in model container [2018-11-23 01:07:19,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:07:19" (3/3) ... [2018-11-23 01:07:19,726 INFO L112 eAbstractionObserver]: Analyzing ICFG ChenFlurMukhopadhyay-SAS2012-Ex2.09_false-no-overflow.c [2018-11-23 01:07:19,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:07:19,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-23 01:07:19,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-23 01:07:19,766 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:07:19,766 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:07:19,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:07:19,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:07:19,767 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:07:19,767 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:07:19,767 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:07:19,767 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:07:19,767 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:07:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 01:07:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:07:19,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:07:19,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:07:19,786 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:07:19,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:07:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1519945914, now seen corresponding path program 1 times [2018-11-23 01:07:19,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:07:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:07:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:07:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:07:19,889 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 01:07:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:07:19,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:07:19,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:07:19,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:07:19,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:07:19,904 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-11-23 01:07:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:07:19,938 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 01:07:19,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:07:19,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:07:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:07:19,948 INFO L225 Difference]: With dead ends: 32 [2018-11-23 01:07:19,948 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 01:07:19,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:07:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 01:07:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 01:07:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 01:07:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 01:07:19,978 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 7 [2018-11-23 01:07:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:07:19,978 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 01:07:19,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:07:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 01:07:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:07:19,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:07:19,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:07:19,980 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:07:19,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:07:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 126316969, now seen corresponding path program 1 times [2018-11-23 01:07:19,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:07:19,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:07:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:19,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:07:19,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:07:20,008 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 01:07:20,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:07:20,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:07:20,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:07:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:07:20,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:07:20,011 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-23 01:07:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:07:20,050 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 01:07:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:07:20,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 01:07:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:07:20,051 INFO L225 Difference]: With dead ends: 33 [2018-11-23 01:07:20,051 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:07:20,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:07:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:07:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-23 01:07:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 01:07:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 01:07:20,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2018-11-23 01:07:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:07:20,056 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 01:07:20,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:07:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 01:07:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:07:20,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:07:20,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:07:20,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:07:20,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:07:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -379141208, now seen corresponding path program 1 times [2018-11-23 01:07:20,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:07:20,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:07:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:07:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:07:20,091 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 01:07:20,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:07:20,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:07:20,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:07:20,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:07:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:07:20,092 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-11-23 01:07:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:07:20,182 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 01:07:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:07:20,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 01:07:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:07:20,183 INFO L225 Difference]: With dead ends: 34 [2018-11-23 01:07:20,183 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:07:20,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:07:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:07:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 01:07:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 01:07:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 01:07:20,187 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 9 [2018-11-23 01:07:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:07:20,187 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 01:07:20,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:07:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 01:07:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:07:20,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:07:20,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:07:20,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 01:07:20,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:07:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1131524491, now seen corresponding path program 1 times [2018-11-23 01:07:20,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:07:20,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:07:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:20,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:07:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:07:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:07:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:07:20,217 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #36#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 <= 2147483647; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 >= -2147483648; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 + ~y~0 <= 2147483647; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume !(-~x~0 + ~y~0 >= -2147483648); VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L23] int x, y, n; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] n = __VERIFIER_nondet_int() [L27] COND TRUE x > 0 && x < n VAL [n=3, x=2, y=-2147483647] [L28] EXPR -x VAL [n=3, x=2, y=-2147483647] [L28] -x + y VAL [n=3, x=2, y=-2147483647] ----- [2018-11-23 01:07:20,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:07:20 BoogieIcfgContainer [2018-11-23 01:07:20,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:07:20,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:07:20,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:07:20,241 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:07:20,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:07:19" (3/4) ... [2018-11-23 01:07:20,243 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 #36#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 <= 2147483647; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 >= -2147483648; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume -~x~0 + ~y~0 <= 2147483647; VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] assume !(-~x~0 + ~y~0 >= -2147483648); VAL [main_~n~0=3, main_~x~0=2, main_~y~0=(- 2147483647)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] assume !!(~x~0 > 0 && ~x~0 < ~n~0); VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L23] havoc ~n~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~n~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L27-L30] COND FALSE !(!(~x~0 > 0 && ~x~0 < ~n~0)) VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 <= 2147483647; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L28] assert -~x~0 + ~y~0 >= -2147483648; VAL [~n~0=3, ~x~0=2, ~y~0=-2147483647] [L23] int x, y, n; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] n = __VERIFIER_nondet_int() [L27] COND TRUE x > 0 && x < n VAL [n=3, x=2, y=-2147483647] [L28] EXPR -x VAL [n=3, x=2, y=-2147483647] [L28] -x + y VAL [n=3, x=2, y=-2147483647] ----- [2018-11-23 01:07:20,269 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cfcb7e59-1b79-430c-a5b2-bf3a43a93e10/bin-2019/uautomizer/witness.graphml [2018-11-23 01:07:20,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:07:20,270 INFO L168 Benchmark]: Toolchain (without parser) took 895.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -111.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:07:20,271 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:07:20,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.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 01:07:20,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:07:20,272 INFO L168 Benchmark]: Boogie Preprocessor took 11.33 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:07:20,272 INFO L168 Benchmark]: RCFGBuilder took 171.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:07:20,273 INFO L168 Benchmark]: TraceAbstraction took 520.34 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:07:20,273 INFO L168 Benchmark]: Witness Printer took 28.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:07:20,276 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.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.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.33 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 520.34 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Witness Printer took 28.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int x, y, n; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] n = __VERIFIER_nondet_int() [L27] COND TRUE x > 0 && x < n VAL [n=3, x=2, y=-2147483647] [L28] EXPR -x VAL [n=3, x=2, y=-2147483647] [L28] -x + y VAL [n=3, x=2, y=-2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 8 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 34 SDslu, 32 SDs, 0 SdLazy, 74 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...