./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_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak --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 Kojak --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 07:05:09,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:05:09,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:05:09,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:05:09,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:05:09,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:05:09,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:05:09,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:05:09,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:05:09,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:05:09,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:05:09,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:05:09,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:05:09,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:05:09,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:05:09,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:05:09,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:05:09,733 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:05:09,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:05:09,736 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:05:09,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:05:09,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:05:09,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:05:09,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:05:09,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:05:09,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:05:09,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:05:09,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:05:09,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:05:09,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:05:09,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:05:09,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:05:09,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:05:09,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:05:09,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:05:09,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:05:09,745 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 07:05:09,752 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:05:09,752 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:05:09,753 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:05:09,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:05:09,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 07:05:09,754 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 07:05:09,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:05:09,755 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:05:09,755 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:05:09,755 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:05:09,755 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:05:09,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:05:09,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:05:09,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:05:09,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:05:09,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:05:09,756 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:05:09,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:05:09,756 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_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak 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 -> Kojak 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 07:05:09,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:05:09,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:05:09,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:05:09,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:05:09,793 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:05:09,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/../../sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i [2018-11-23 07:05:09,837 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/data/06abc0a92/9e548cc2ec624f82ab3519e4e26eff2f/FLAG0770c3475 [2018-11-23 07:05:10,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:05:10,219 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/sv-benchmarks/c/array-memsafety/selectionsort_unsafe_false-valid-deref.i [2018-11-23 07:05:10,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/data/06abc0a92/9e548cc2ec624f82ab3519e4e26eff2f/FLAG0770c3475 [2018-11-23 07:05:10,231 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/data/06abc0a92/9e548cc2ec624f82ab3519e4e26eff2f [2018-11-23 07:05:10,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:05:10,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:05:10,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:05:10,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:05:10,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:05:10,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c360083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10, skipping insertion in model container [2018-11-23 07:05:10,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:05:10,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:05:10,358 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:05:10,364 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:05:10,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:05:10,382 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:05:10,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10 WrapperNode [2018-11-23 07:05:10,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:05:10,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:05:10,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:05:10,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:05:10,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:05:10,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:05:10,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:05:10,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:05:10,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:05:10,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:05:10,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:05:10,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:05:10,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:05:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 07:05:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:05:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:05:10,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:05:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:05:10,776 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:05:10,776 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 07:05:10,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:05:10 BoogieIcfgContainer [2018-11-23 07:05:10,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:05:10,777 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:05:10,777 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:05:10,787 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:05:10,787 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:05:10" (1/1) ... [2018-11-23 07:05:10,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:05:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:05:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 24 states and 25 transitions. [2018-11-23 07:05:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 07:05:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 07:05:10,820 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:05:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:05:10,946 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 07:05:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:05:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 26 states and 28 transitions. [2018-11-23 07:05:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 07:05:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 07:05:10,981 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:05:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:05:11,012 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 07:05:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:05:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 27 states and 29 transitions. [2018-11-23 07:05:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 07:05:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 07:05:11,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:05:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:05:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:05:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:05:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:05:11,089 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 3 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647;main_~array_size~0 := main_#t~nondet6;havoc main_#t~nondet6;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !(1 == #valid[SelectionSort_~a.base]); VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L20] havoc main_~a~0.base, main_~a~0.offset; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1); [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] call SelectionSort_#t~mem2 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L20] havoc main_~a~0.base, main_~a~0.offset; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1); [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] call SelectionSort_#t~mem2 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, 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, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0, main_~array_size~0; [L20] havoc main_~a~0; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a, SelectionSort_#in~array_size := main_~a~0, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a := SelectionSort_#in~a; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] COND FALSE !(!(SelectionSort_~i~0 < SelectionSort_~array_size - 1)) [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] COND FALSE !(!(SelectionSort_~j~0 < SelectionSort_~array_size)) VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] FCALL call SelectionSort_#t~mem2 := read~int({ base: SelectionSort_~a!base, offset: SelectionSort_~a!offset + 4 * SelectionSort_~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0, main_~array_size~0; [L20] havoc main_~a~0; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a, SelectionSort_#in~array_size := main_~a~0, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a := SelectionSort_#in~a; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] COND FALSE !(!(SelectionSort_~i~0 < SelectionSort_~array_size - 1)) [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] COND FALSE !(!(SelectionSort_~j~0 < SelectionSort_~array_size)) VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] FCALL call SelectionSort_#t~mem2 := read~int({ base: SelectionSort_~a!base, offset: SelectionSort_~a!offset + 4 * SelectionSort_~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, 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, offset: 0 }; [?] #valid[0] := 0; [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=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 [#NULL!base=0, #NULL!offset=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#NULL!base=0, #NULL!offset=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=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 [#NULL!base=0, #NULL!offset=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#NULL!base=0, #NULL!offset=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L20] int *a; [L21] int array_size = __VERIFIER_nondet_int(); [L4] int i; [L5] i = 0 [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 [L9] COND TRUE j < array_size [L11] a[j] ----- [2018-11-23 07:05:11,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:05:11 ImpRootNode [2018-11-23 07:05:11,118 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:05:11,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:05:11,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:05:11,119 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:05:11,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:05:10" (3/4) ... [2018-11-23 07:05:11,122 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc main_~a~0.base, main_~a~0.offset;assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647;main_~array_size~0 := main_#t~nondet6;havoc main_#t~nondet6;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] assume !(1 == #valid[SelectionSort_~a.base]); VAL [ULTIMATE.start_main_~array_size~0=2, ULTIMATE.start_main_~a~0.base=4, ULTIMATE.start_main_~a~0.offset=3, ULTIMATE.start_SelectionSort_~a.base=4, ULTIMATE.start_SelectionSort_~a.offset=3, ULTIMATE.start_SelectionSort_~array_size=2, ULTIMATE.start_SelectionSort_~i~0=0, ULTIMATE.start_SelectionSort_~j~0=1, ULTIMATE.start_SelectionSort_~min~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_SelectionSort_#in~a.base|=4, |ULTIMATE.start_SelectionSort_#in~a.offset|=3, |ULTIMATE.start_SelectionSort_#in~array_size|=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L20] havoc main_~a~0.base, main_~a~0.offset; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1); [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] call SelectionSort_#t~mem2 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L20] havoc main_~a~0.base, main_~a~0.offset; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1); [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] assume !!(SelectionSort_~j~0 < SelectionSort_~array_size); VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a.base=4, SelectionSort_~a.offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] call SelectionSort_#t~mem2 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=2, main_~a~0.base=4, main_~a~0.offset=3, SelectionSort_#in~a.base=4, SelectionSort_#in~a.offset=3, SelectionSort_#in~array_size=2, 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, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0, main_~array_size~0; [L20] havoc main_~a~0; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a, SelectionSort_#in~array_size := main_~a~0, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a := SelectionSort_#in~a; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] COND FALSE !(!(SelectionSort_~i~0 < SelectionSort_~array_size - 1)) [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] COND FALSE !(!(SelectionSort_~j~0 < SelectionSort_~array_size)) VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] FCALL call SelectionSort_#t~mem2 := read~int({ base: SelectionSort_~a!base, offset: SelectionSort_~a!offset + 4 * SelectionSort_~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet6, main_~a~0, main_~array_size~0; [L20] havoc main_~a~0; [L21] assume -2147483648 <= main_#t~nondet6 && main_#t~nondet6 <= 2147483647; [L21] main_~array_size~0 := main_#t~nondet6; [L21] havoc main_#t~nondet6; [L22] SelectionSort_#in~a, SelectionSort_#in~array_size := main_~a~0, main_~array_size~0; [L22] havoc SelectionSort_#t~mem2, SelectionSort_#t~mem3, SelectionSort_#t~pre1, SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre0, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a, SelectionSort_~array_size, SelectionSort_~i~0; [L2-L18] SelectionSort_~a := SelectionSort_#in~a; [L2-L18] SelectionSort_~array_size := SelectionSort_#in~array_size; [L4] havoc SelectionSort_~i~0; [L5] SelectionSort_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0] [L5-L17] COND FALSE !(!(SelectionSort_~i~0 < SelectionSort_~array_size - 1)) [L7] havoc SelectionSort_~j~0; [L7] havoc SelectionSort_~min~0; [L7] havoc SelectionSort_~temp~0; [L8] SelectionSort_~min~0 := SelectionSort_~i~0; [L9] SelectionSort_~j~0 := 1 + SelectionSort_~i~0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L9-L13] COND FALSE !(!(SelectionSort_~j~0 < SelectionSort_~array_size)) VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, SelectionSort_~a!base=4, SelectionSort_~a!offset=3, SelectionSort_~array_size=2, SelectionSort_~i~0=0, SelectionSort_~j~0=1, SelectionSort_~min~0=0] [L11] FCALL call SelectionSort_#t~mem2 := read~int({ base: SelectionSort_~a!base, offset: SelectionSort_~a!offset + 4 * SelectionSort_~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=2, main_~a~0!base=4, main_~a~0!offset=3, SelectionSort_#in~a!base=4, SelectionSort_#in~a!offset=3, SelectionSort_#in~array_size=2, 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, offset: 0 }; [?] #valid[0] := 0; [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=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 [#NULL!base=0, #NULL!offset=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#NULL!base=0, #NULL!offset=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L20] havoc ~a~0; [L21] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L21] ~array_size~0 := #t~nondet6; [L21] havoc #t~nondet6; [L2-L18] ~a := #in~a; [L2-L18] ~array_size := #in~array_size; [L4] havoc ~i~0; [L5] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=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 [#NULL!base=0, #NULL!offset=0] [L9-L13] COND FALSE !(!(~j~0 < ~array_size)) VAL [#NULL!base=0, #NULL!offset=0] [L11] FCALL call #t~mem2 := read~int({ base: ~a!base, offset: ~a!offset + 4 * ~j~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L20] int *a; [L21] int array_size = __VERIFIER_nondet_int(); [L4] int i; [L5] i = 0 [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 [L9] COND TRUE j < array_size [L11] a[j] ----- [2018-11-23 07:05:11,159 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_059673cc-6223-4781-a912-41aafe9661bd/bin-2019/ukojak/witness.graphml [2018-11-23 07:05:11,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:05:11,160 INFO L168 Benchmark]: Toolchain (without parser) took 926.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,161 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:05:11,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.19 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.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 07:05:11,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.26 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 945.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,162 INFO L168 Benchmark]: Boogie Preprocessor took 51.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,162 INFO L168 Benchmark]: RCFGBuilder took 319.45 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,163 INFO L168 Benchmark]: CodeCheck took 341.24 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,163 INFO L168 Benchmark]: Witness Printer took 40.41 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:05:11,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 32 locations, 13 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14 SDtfs, 4 SDslu, 4 SDs, 0 SdLazy, 22 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 33 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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(); [L4] int i; [L5] i = 0 [L5] COND TRUE i < array_size - 1 [L7] int j, min, temp; [L8] min = i [L9] j = i+1 [L9] COND TRUE j < array_size [L11] a[j] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.19 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 950.5 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 23.26 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 945.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 319.45 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * CodeCheck took 341.24 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Witness Printer took 40.41 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...