./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 952278f5e85aedce23895e068e08311605efdfa8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:33:39,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:33:39,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:33:39,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:33:39,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:33:39,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:33:39,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:33:39,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:33:39,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:33:39,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:33:39,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:33:39,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:33:39,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:33:39,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:33:39,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:33:39,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:33:39,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:33:39,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:33:39,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:33:39,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:33:39,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:33:39,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:33:39,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:33:39,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:33:39,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:33:39,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:33:39,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:33:39,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:33:39,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:33:39,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:33:39,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:33:39,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:33:39,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:33:39,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:33:39,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:33:39,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:33:39,544 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 14:33:39,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:33:39,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:33:39,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:33:39,552 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:33:39,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:33:39,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:33:39,552 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:33:39,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:33:39,552 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:33:39,552 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:33:39,553 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:33:39,554 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:33:39,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:33:39,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:33:39,554 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:33:39,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:33:39,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:33:39,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:33:39,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:33:39,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:33:39,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:33:39,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_d09111b3-9c08-4950-b95b-6e1f6945533d/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 952278f5e85aedce23895e068e08311605efdfa8 [2018-11-23 14:33:39,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:33:39,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:33:39,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:33:39,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:33:39,592 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:33:39,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i [2018-11-23 14:33:39,627 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/data/6358a1c25/8b303a96e70e4b9b93efc94d7d64b196/FLAGd58ca372e [2018-11-23 14:33:39,929 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:33:39,930 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i [2018-11-23 14:33:39,934 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/data/6358a1c25/8b303a96e70e4b9b93efc94d7d64b196/FLAGd58ca372e [2018-11-23 14:33:39,944 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/data/6358a1c25/8b303a96e70e4b9b93efc94d7d64b196 [2018-11-23 14:33:39,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:33:39,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 14:33:39,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:33:39,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:33:39,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:33:39,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:39" (1/1) ... [2018-11-23 14:33:39,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc0002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:39, skipping insertion in model container [2018-11-23 14:33:39,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:39" (1/1) ... [2018-11-23 14:33:39,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:33:39,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:33:40,080 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:33:40,088 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:33:40,098 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:33:40,108 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:33:40,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40 WrapperNode [2018-11-23 14:33:40,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:33:40,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:33:40,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:33:40,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:33:40,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... [2018-11-23 14:33:40,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:33:40,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:33:40,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:33:40,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:33:40,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/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 14:33:40,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:33:40,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:33:40,204 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-11-23 14:33:40,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:33:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:33:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:33:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:33:40,357 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:33:40,357 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:33:40,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:40 BoogieIcfgContainer [2018-11-23 14:33:40,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:33:40,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:33:40,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:33:40,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:33:40,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:33:39" (1/3) ... [2018-11-23 14:33:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27da93d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:40, skipping insertion in model container [2018-11-23 14:33:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:40" (2/3) ... [2018-11-23 14:33:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27da93d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:40, skipping insertion in model container [2018-11-23 14:33:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:40" (3/3) ... [2018-11-23 14:33:40,364 INFO L112 eAbstractionObserver]: Analyzing ICFG selectionsort_unsafe_false-valid-deref.i [2018-11-23 14:33:40,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:33:40,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-23 14:33:40,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-23 14:33:40,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:33:40,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:33:40,409 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 14:33:40,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:33:40,409 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:33:40,410 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:33:40,410 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:33:40,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:33:40,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:33:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 14:33:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:33:40,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:33:40,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:33:40,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 14:33:40,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:33:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash 229154885, now seen corresponding path program 1 times [2018-11-23 14:33:40,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:33:40,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:33:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:33:40,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:33:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:33:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:33:40,534 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 14:33:40,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:33:40,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:33:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:33:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:33:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:33:40,548 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-23 14:33:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:33:40,582 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 14:33:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:33:40,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 14:33:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:33:40,590 INFO L225 Difference]: With dead ends: 41 [2018-11-23 14:33:40,590 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 14:33:40,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:33:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 14:33:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 14:33:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 14:33:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 14:33:40,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 11 [2018-11-23 14:33:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:33:40,614 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 14:33:40,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:33:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 14:33:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:33:40,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:33:40,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:33:40,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr6REQUIRES_VIOLATION, SelectionSortErr1REQUIRES_VIOLATION, SelectionSortErr7REQUIRES_VIOLATION, SelectionSortErr10REQUIRES_VIOLATION, SelectionSortErr5REQUIRES_VIOLATION, SelectionSortErr0REQUIRES_VIOLATION, SelectionSortErr11REQUIRES_VIOLATION, SelectionSortErr9REQUIRES_VIOLATION, SelectionSortErr4REQUIRES_VIOLATION, SelectionSortErr2REQUIRES_VIOLATION, SelectionSortErr8REQUIRES_VIOLATION, SelectionSortErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 14:33:40,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:33:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash 229154931, now seen corresponding path program 1 times [2018-11-23 14:33:40,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:33:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:33:40,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:33:40,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:33:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:33:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:33:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:33:40,657 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #64#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0.base, ~a~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~array_size~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~array_size~0=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;~array_size := #in~array_size;havoc ~i~0;~i~0 := 0; VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !!(~i~0 < ~array_size - 1);havoc ~j~0;havoc ~min~0;havoc ~temp~0;~min~0 := ~i~0;~j~0 := 1 + ~i~0; VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !!(~j~0 < ~array_size); VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !(1 == #valid[~a.base]); VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L20] havoc ~a~0.base, ~a~0.offset; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0] [L2-L18] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0] [L5-L17] assume !!(~i~0 < ~array_size - 1); [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] assume !!(~j~0 < ~array_size); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L20] havoc ~a~0.base, ~a~0.offset; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0] [L2-L18] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0] [L5-L17] assume !!(~i~0 < ~array_size - 1); [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] assume !!(~j~0 < ~array_size); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0, ~array_size~0); VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0] [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0] [L5-L17] COND FALSE !(!(~i~0 < ~array_size - 1)) [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0, ~array_size~0); VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0] [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0] [L5-L17] COND FALSE !(!(~i~0 < ~array_size - 1)) [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L20] int *a; [L21] int array_size = __VERIFIER_nondet_int(); [L22] CALL SelectionSort(a, array_size) VAL [\old(array_size)=2, a={4:3}] [L4] int i; [L5] i = 0 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0] [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L9] COND TRUE j < array_size VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L11] a[j] ----- [2018-11-23 14:33:40,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:33:40 BoogieIcfgContainer [2018-11-23 14:33:40,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:33:40,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:33:40,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:33:40,681 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:33:40,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:40" (3/4) ... [2018-11-23 14:33:40,683 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=2, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=2] [?] RET #64#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0.base, ~a~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~array_size~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~array_size~0=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;~array_size := #in~array_size;havoc ~i~0;~i~0 := 0; VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !!(~i~0 < ~array_size - 1);havoc ~j~0;havoc ~min~0;havoc ~temp~0;~min~0 := ~i~0;~j~0 := 1 + ~i~0; VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !!(~j~0 < ~array_size); VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] assume !(1 == #valid[~a.base]); VAL [SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |SelectionSort_#in~a.base|=4, |SelectionSort_#in~a.offset|=3, |SelectionSort_#in~array_size|=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L20] havoc ~a~0.base, ~a~0.offset; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0] [L2-L18] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0] [L5-L17] assume !!(~i~0 < ~array_size - 1); [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] assume !!(~j~0 < ~array_size); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=2, old(#NULL.base)=5, old(#NULL.offset)=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L20] havoc ~a~0.base, ~a~0.offset; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0.base, ~a~0.offset, ~array_size~0); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0] [L2-L18] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0] [L5-L17] assume !!(~i~0 < ~array_size - 1); [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] assume !!(~j~0 < ~array_size); VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a.base=4, #in~a.offset=3, #in~array_size=2, #NULL.base=0, #NULL.offset=0, ~a.base=4, ~a.offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0, ~array_size~0); VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0] [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0] [L5-L17] COND FALSE !(!(~i~0 < ~array_size - 1)) [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=2, old(#NULL!base)=5, old(#NULL!offset)=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=2] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~array_size~0=2] [L22] CALL call SelectionSort(~a~0, ~array_size~0); VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0] [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0] [L5-L17] COND FALSE !(!(~i~0 < ~array_size - 1)) [L7] havoc ~j~0; [L7] havoc ~min~0; [L7] havoc ~temp~0; [L8] ~min~0 := ~i~0; [L9] ~j~0 := 1 + ~i~0; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~a!base=4, #in~a!offset=3, #in~array_size=2, #NULL!base=0, #NULL!offset=0, ~a!base=4, ~a!offset=3, ~array_size=2, ~i~0=0, ~j~0=1, ~min~0=0] [L20] int *a; [L21] int array_size = __VERIFIER_nondet_int(); [L22] CALL SelectionSort(a, array_size) VAL [\old(array_size)=2, a={4:3}] [L4] int i; [L5] i = 0 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0] [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L9] COND TRUE j < array_size VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L11] a[j] ----- [2018-11-23 14:33:40,716 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d09111b3-9c08-4950-b95b-6e1f6945533d/bin-2019/uautomizer/witness.graphml [2018-11-23 14:33:40,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:33:40,717 INFO L168 Benchmark]: Toolchain (without parser) took 770.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:33:40,718 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 14:33:40,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:33:40,719 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:33:40,719 INFO L168 Benchmark]: RCFGBuilder took 224.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:33:40,720 INFO L168 Benchmark]: TraceAbstraction took 322.37 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:33:40,720 INFO L168 Benchmark]: Witness Printer took 35.84 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 14:33:40,723 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 160.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 322.37 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 35.84 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: 11]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L20] int *a; [L21] int array_size = __VERIFIER_nondet_int(); [L22] CALL SelectionSort(a, array_size) VAL [\old(array_size)=2, a={4:3}] [L4] int i; [L5] i = 0 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0] [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L9] COND TRUE j < array_size VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L11] a[j] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 13 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 9 SDslu, 28 SDs, 0 SdLazy, 9 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...