./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort_unsafe.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/selectionsort_unsafe.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 153befabdb18c1c2f846632066e19b90cbc378dfb8679471b93a472fb2c83770 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:42:04,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:42:04,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:42:04,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:42:04,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:42:04,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:42:04,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:42:04,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:42:04,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:42:04,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:42:04,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:42:04,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:42:04,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:42:04,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:42:04,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:42:04,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:42:04,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:42:04,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:42:04,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:42:04,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:42:04,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:42:04,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:42:04,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:42:04,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:42:04,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:42:04,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:42:04,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:42:04,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:42:04,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:42:04,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:42:04,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:42:04,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:42:04,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:42:04,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:42:04,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:42:04,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:42:04,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:42:04,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:42:04,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:42:04,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:42:04,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:42:04,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:42:04,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:42:04,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:42:04,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:42:04,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:42:04,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:42:04,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:42:04,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:42:04,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:42:04,166 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:42:04,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:42:04,167 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:42:04,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:42:04,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:42:04,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:42:04,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:42:04,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:42:04,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:42:04,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:42:04,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:42:04,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:42:04,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 153befabdb18c1c2f846632066e19b90cbc378dfb8679471b93a472fb2c83770 [2022-02-20 23:42:04,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:42:04,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:42:04,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:42:04,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:42:04,384 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:42:04,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort_unsafe.c [2022-02-20 23:42:04,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a088030/84ac93332b8f46259845f614a34ebea6/FLAG3724769ea [2022-02-20 23:42:04,785 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:42:04,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort_unsafe.c [2022-02-20 23:42:04,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a088030/84ac93332b8f46259845f614a34ebea6/FLAG3724769ea [2022-02-20 23:42:04,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a088030/84ac93332b8f46259845f614a34ebea6 [2022-02-20 23:42:04,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:42:04,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:42:04,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:04,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:42:04,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:42:04,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:04,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8707a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04, skipping insertion in model container [2022-02-20 23:42:04,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:04,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:42:04,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:42:04,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:04,938 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:42:04,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:04,962 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:42:04,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04 WrapperNode [2022-02-20 23:42:04,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:04,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:42:04,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:42:04,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:42:04,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:04,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:04,999 INFO L137 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2022-02-20 23:42:05,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:42:05,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:42:05,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:42:05,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:42:05,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:42:05,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:42:05,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:42:05,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:42:05,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (1/1) ... [2022-02-20 23:42:05,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:42:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:42:05,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:42:05,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:42:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:42:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:42:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:42:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:42:05,124 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:42:05,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:42:05,312 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:42:05,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:42:05,317 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:42:05,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:05 BoogieIcfgContainer [2022-02-20 23:42:05,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:42:05,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:42:05,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:42:05,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:42:05,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:42:04" (1/3) ... [2022-02-20 23:42:05,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474c3473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:42:05, skipping insertion in model container [2022-02-20 23:42:05,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:04" (2/3) ... [2022-02-20 23:42:05,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474c3473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:42:05, skipping insertion in model container [2022-02-20 23:42:05,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:05" (3/3) ... [2022-02-20 23:42:05,328 INFO L111 eAbstractionObserver]: Analyzing ICFG selectionsort_unsafe.c [2022-02-20 23:42:05,332 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:42:05,332 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-02-20 23:42:05,360 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:42:05,364 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:42:05,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-02-20 23:42:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 2.0) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:42:05,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:05,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:42:05,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 9 more)] === [2022-02-20 23:42:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 28740435, now seen corresponding path program 1 times [2022-02-20 23:42:05,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:05,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544127209] [2022-02-20 23:42:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:05,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {35#true} is VALID [2022-02-20 23:42:05,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~array_size~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre1#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre0#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; {35#true} is VALID [2022-02-20 23:42:05,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 23:42:05,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#false} assume { :end_inline_SelectionSort } true;main_#res#1 := 0; {36#false} is VALID [2022-02-20 23:42:05,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#false} assume !(#valid == main_old_#valid#1); {36#false} is VALID [2022-02-20 23:42:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:05,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:42:05,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544127209] [2022-02-20 23:42:05,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544127209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:05,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:05,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:05,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925108431] [2022-02-20 23:42:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:05,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:05,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:05,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:42:05,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:42:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:42:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:42:05,598 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 2.0) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,641 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 23:42:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:42:05,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 23:42:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 23:42:05,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2022-02-20 23:42:05,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:05,701 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:42:05,701 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:42:05,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:42:05,708 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:05,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:42:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:42:05,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:05,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,733 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,734 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,742 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:42:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:42:05,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:05,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:05,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:42:05,745 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:42:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,747 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:42:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:42:05,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:05,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:05,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:05,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-20 23:42:05,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 5 [2022-02-20 23:42:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:05,751 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-20 23:42:05,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:42:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:42:05,752 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:05,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:42:05,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:42:05,753 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 9 more)] === [2022-02-20 23:42:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 28698151, now seen corresponding path program 1 times [2022-02-20 23:42:05,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:05,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191790783] [2022-02-20 23:42:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:05,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2022-02-20 23:42:05,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~array_size~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre1#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre0#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:42:05,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1); {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:42:05,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume { :end_inline_SelectionSort } true;main_#res#1 := 0; {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:42:05,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {162#false} is VALID [2022-02-20 23:42:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:05,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:42:05,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191790783] [2022-02-20 23:42:05,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191790783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:05,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:05,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:05,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719262626] [2022-02-20 23:42:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:05,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:05,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:05,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:05,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:42:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:05,834 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,887 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 23:42:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 23:42:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 23:42:05,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-20 23:42:05,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:05,928 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:42:05,928 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:42:05,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:05,934 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:05,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:42:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:42:05,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:05,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,944 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,945 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,946 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 23:42:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:42:05,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:05,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:05,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:42:05,947 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 23:42:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:05,949 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 23:42:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:42:05,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:05,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:05,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:05,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 23:42:05,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 5 [2022-02-20 23:42:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:05,950 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 23:42:05,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:42:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:42:05,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:05,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:42:05,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:42:05,951 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 9 more)] === [2022-02-20 23:42:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 28698875, now seen corresponding path program 1 times [2022-02-20 23:42:05,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:05,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414370587] [2022-02-20 23:42:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:05,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {276#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {276#true} is VALID [2022-02-20 23:42:05,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc main_~a~0#1.base, main_~a~0#1.offset;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~array_size~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_SelectionSort } true;SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset, SelectionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc SelectionSort_#t~mem2#1, SelectionSort_#t~mem3#1, SelectionSort_#t~pre1#1, SelectionSort_#t~mem4#1, SelectionSort_#t~mem5#1, SelectionSort_#t~pre0#1, SelectionSort_~j~0#1, SelectionSort_~min~0#1, SelectionSort_~temp~0#1, SelectionSort_~a#1.base, SelectionSort_~a#1.offset, SelectionSort_~array_size#1, SelectionSort_~i~0#1;SelectionSort_~a#1.base, SelectionSort_~a#1.offset := SelectionSort_#in~a#1.base, SelectionSort_#in~a#1.offset;SelectionSort_~array_size#1 := SelectionSort_#in~array_size#1;havoc SelectionSort_~i~0#1;SelectionSort_~i~0#1 := 0; {276#true} is VALID [2022-02-20 23:42:05,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume !!(SelectionSort_~i~0#1 < SelectionSort_~array_size#1 - 1);havoc SelectionSort_~j~0#1;havoc SelectionSort_~min~0#1;havoc SelectionSort_~temp~0#1;SelectionSort_~min~0#1 := SelectionSort_~i~0#1;SelectionSort_~j~0#1 := 1 + SelectionSort_~i~0#1; {278#(<= (+ |ULTIMATE.start_SelectionSort_~j~0#1| 1) |ULTIMATE.start_SelectionSort_~array_size#1|)} is VALID [2022-02-20 23:42:05,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {278#(<= (+ |ULTIMATE.start_SelectionSort_~j~0#1| 1) |ULTIMATE.start_SelectionSort_~array_size#1|)} assume !(SelectionSort_~j~0#1 < SelectionSort_~array_size#1); {277#false} is VALID [2022-02-20 23:42:05,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#false} assume !(1 == #valid[SelectionSort_~a#1.base]); {277#false} is VALID [2022-02-20 23:42:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:05,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:42:05,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414370587] [2022-02-20 23:42:05,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414370587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:05,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:05,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:42:05,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385764373] [2022-02-20 23:42:05,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:05,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:05,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:05,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:05,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:05,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:42:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:05,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:05,997 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:06,028 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:42:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:42:06,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 23:42:06,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:06,058 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:42:06,058 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:42:06,058 INFO L932 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 [2022-02-20 23:42:06,059 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:06,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:42:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:42:06,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:06,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,061 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,061 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:06,062 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:06,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:06,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:06,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:06,063 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:06,063 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:06,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:06,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:06,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:06,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.875) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-20 23:42:06,065 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 5 [2022-02-20 23:42:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:06,065 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-20 23:42:06,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:42:06,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:06,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:42:06,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:42:06,066 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 9 more)] === [2022-02-20 23:42:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-02-20 23:42:06,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:42:06,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007085839] [2022-02-20 23:42:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:42:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:06,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:42:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:06,111 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:42:06,111 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:42:06,112 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (12 of 13 remaining) [2022-02-20 23:42:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (11 of 13 remaining) [2022-02-20 23:42:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (10 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (9 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (8 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (7 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (6 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (5 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (4 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (3 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (2 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (1 of 13 remaining) [2022-02-20 23:42:06,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-02-20 23:42:06,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:42:06,117 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 23:42:06,119 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:42:06,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:42:06 BoogieIcfgContainer [2022-02-20 23:42:06,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:42:06,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:42:06,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:42:06,132 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:42:06,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:05" (3/4) ... [2022-02-20 23:42:06,134 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:42:06,160 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:42:06,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:42:06,161 INFO L158 Benchmark]: Toolchain (without parser) took 1360.15ms. Allocated memory is still 121.6MB. Free memory was 90.2MB in the beginning and 66.5MB in the end (delta: 23.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,161 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:42:06,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.67ms. Allocated memory is still 121.6MB. Free memory was 90.2MB in the beginning and 96.9MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.73ms. Allocated memory is still 121.6MB. Free memory was 96.9MB in the beginning and 95.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,162 INFO L158 Benchmark]: Boogie Preprocessor took 21.60ms. Allocated memory is still 121.6MB. Free memory was 95.2MB in the beginning and 93.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,162 INFO L158 Benchmark]: RCFGBuilder took 296.30ms. Allocated memory is still 121.6MB. Free memory was 93.9MB in the beginning and 80.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,162 INFO L158 Benchmark]: TraceAbstraction took 811.89ms. Allocated memory is still 121.6MB. Free memory was 80.2MB in the beginning and 68.6MB in the end (delta: 11.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,163 INFO L158 Benchmark]: Witness Printer took 28.24ms. Allocated memory is still 121.6MB. Free memory was 68.6MB in the beginning and 66.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:42:06,165 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.67ms. Allocated memory is still 121.6MB. Free memory was 90.2MB in the beginning and 96.9MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.73ms. Allocated memory is still 121.6MB. Free memory was 96.9MB in the beginning and 95.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.60ms. Allocated memory is still 121.6MB. Free memory was 95.2MB in the beginning and 93.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 296.30ms. Allocated memory is still 121.6MB. Free memory was 93.9MB in the beginning and 80.6MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 811.89ms. Allocated memory is still 121.6MB. Free memory was 80.2MB in the beginning and 68.6MB in the end (delta: 11.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 28.24ms. Allocated memory is still 121.6MB. Free memory was 68.6MB in the beginning and 66.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L23] int *a; [L24] int array_size = __VERIFIER_nondet_int(); [L25] CALL SelectionSort(a, array_size) [L5] int i; [L6] i = 0 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0] [L6] COND TRUE i < array_size - 1 [L8] int j, min, temp; [L9] min = i [L10] j = i+1 VAL [\old(array_size)=2, a={4:3}, a={4:3}, array_size=2, i=0, j=1, min=0] [L10] 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] [L12] a[j] - UnprovableResult [Line: 12]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 77 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:42:06,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)