./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort_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/bubblesort_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 5eaae4e0e100231882d4e227389aa6df1e49e6fa56c0a085febf2800aa4ad8fe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:39:06,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:39:06,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:39:06,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:39:06,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:39:06,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:39:06,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:39:06,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:39:06,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:39:06,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:39:06,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:39:06,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:39:06,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:39:06,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:39:06,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:39:06,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:39:06,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:39:06,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:39:06,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:39:06,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:39:06,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:39:06,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:39:06,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:39:06,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:39:06,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:39:06,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:39:06,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:39:06,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:39:06,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:39:06,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:39:06,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:39:06,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:39:06,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:39:06,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:39:06,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:39:06,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:39:06,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:39:06,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:39:06,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:39:06,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:39:06,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:39:06,607 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:39:06,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:39:06,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:39:06,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:39:06,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:39:06,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:39:06,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:39:06,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:39:06,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:39:06,634 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:39:06,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:39:06,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:39:06,647 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:39:06,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:39:06,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:39:06,649 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:39:06,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:39:06,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:39:06,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:39:06,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:39:06,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:39:06,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:06,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:39:06,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:39:06,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:39:06,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:39:06,651 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 -> 5eaae4e0e100231882d4e227389aa6df1e49e6fa56c0a085febf2800aa4ad8fe [2022-02-20 23:39:07,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:39:07,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:39:07,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:39:07,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:39:07,079 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:39:07,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort_unsafe.c [2022-02-20 23:39:07,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd3118c0/75319a2dc5224164ae13ed6b7612d266/FLAGd215198a1 [2022-02-20 23:39:07,643 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:39:07,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort_unsafe.c [2022-02-20 23:39:07,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd3118c0/75319a2dc5224164ae13ed6b7612d266/FLAGd215198a1 [2022-02-20 23:39:08,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd3118c0/75319a2dc5224164ae13ed6b7612d266 [2022-02-20 23:39:08,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:39:08,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:39:08,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:08,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:39:08,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:39:08,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471a99f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08, skipping insertion in model container [2022-02-20 23:39:08,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:39:08,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:39:08,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:08,233 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:39:08,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:39:08,258 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:39:08,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08 WrapperNode [2022-02-20 23:39:08,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:39:08,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:08,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:39:08,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:39:08,266 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:39:08" (1/1) ... [2022-02-20 23:39:08,272 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:39:08" (1/1) ... [2022-02-20 23:39:08,293 INFO L137 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-20 23:39:08,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:39:08,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:39:08,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:39:08,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:39:08,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:39:08,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:39:08,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:39:08,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:39:08,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (1/1) ... [2022-02-20 23:39:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:39:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:39:08,368 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:39:08,385 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:39:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:39:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:39:08,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:39:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:39:08,442 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:39:08,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:39:08,627 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:39:08,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:39:08,639 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:39:08,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:08 BoogieIcfgContainer [2022-02-20 23:39:08,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:39:08,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:39:08,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:39:08,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:39:08,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:39:08" (1/3) ... [2022-02-20 23:39:08,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544e37d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:08, skipping insertion in model container [2022-02-20 23:39:08,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:39:08" (2/3) ... [2022-02-20 23:39:08,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544e37d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:39:08, skipping insertion in model container [2022-02-20 23:39:08,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:08" (3/3) ... [2022-02-20 23:39:08,661 INFO L111 eAbstractionObserver]: Analyzing ICFG bubblesort_unsafe.c [2022-02-20 23:39:08,665 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:39:08,666 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-02-20 23:39:08,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:39:08,754 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:39:08,757 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-02-20 23:39:08,777 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:39:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:39:08,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:08,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:39:08,788 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:39:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 28739442, now seen corresponding path program 1 times [2022-02-20 23:39:08,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:08,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455724125] [2022-02-20 23:39:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,047 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:39:09,048 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_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc main_~numbers~0#1.base, main_~numbers~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_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post1#1, bubbleSort_#t~post0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {35#true} is VALID [2022-02-20 23:39:09,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 23:39:09,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#false} assume { :end_inline_bubbleSort } true;main_#res#1 := 0; {36#false} is VALID [2022-02-20 23:39:09,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#false} assume !(#valid == main_old_#valid#1); {36#false} is VALID [2022-02-20 23:39:09,060 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:39:09,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455724125] [2022-02-20 23:39:09,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455724125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:39:09,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68252040] [2022-02-20 23:39:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,067 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:39:09,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,077 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:39:09,092 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:39:09,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:39:09,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:39:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:39:09,137 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:39:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,227 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 23:39:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:39:09,228 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:39:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:09,231 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:39:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 23:39:09,246 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:39:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 23:39:09,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2022-02-20 23:39:09,328 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:39:09,334 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:39:09,334 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:39:09,335 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:39:09,338 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:39:09,338 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:39:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:39:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:39:09,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:09,367 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:39:09,367 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:39:09,368 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:39:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,378 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:39:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:39:09,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,380 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:39:09,381 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:39:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,383 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 23:39:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:39:09,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:09,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:09,384 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:39:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-20 23:39:09,392 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 5 [2022-02-20 23:39:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-20 23:39:09,393 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:39:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:39:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:39:09,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:09,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:39:09,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:39:09,394 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:39:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 28698119, now seen corresponding path program 1 times [2022-02-20 23:39:09,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735842338] [2022-02-20 23:39:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:39:09,440 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:39:09,442 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_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc main_~numbers~0#1.base, main_~numbers~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_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post1#1, bubbleSort_#t~post0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:39:09,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(bubbleSort_~i~0#1 >= 0); {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:39:09,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume { :end_inline_bubbleSort } true;main_#res#1 := 0; {163#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:39:09,445 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:39:09,445 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:39:09,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:39:09,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735842338] [2022-02-20 23:39:09,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735842338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:39:09,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:39:09,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:39:09,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398718016] [2022-02-20 23:39:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:39:09,451 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:39:09,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:39:09,453 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:39:09,460 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:39:09,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:39:09,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:39:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:39:09,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:39:09,465 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:39:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,517 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 23:39:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:39:09,518 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:39:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:39:09,518 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:39:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 23:39:09,520 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:39:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 23:39:09,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-20 23:39:09,550 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:39:09,553 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:39:09,553 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:39:09,554 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:39:09,558 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:39:09,559 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:39:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:39:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:39:09,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:39:09,561 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:39:09,561 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:39:09,562 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:39:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,563 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 23:39:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:39:09,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,564 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:39:09,564 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:39:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:39:09,565 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-20 23:39:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:39:09,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:39:09,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:39:09,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:39:09,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:39:09,566 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:39:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 23:39:09,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 5 [2022-02-20 23:39:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:39:09,567 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 23:39:09,568 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:39:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:39:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:39:09,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:39:09,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:39:09,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:39:09,569 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 9 more)] === [2022-02-20 23:39:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:39:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-02-20 23:39:09,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:39:09,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475817019] [2022-02-20 23:39:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:39:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:39:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:09,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:39:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:39:09,603 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:39:09,603 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:39:09,604 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (12 of 13 remaining) [2022-02-20 23:39:09,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (11 of 13 remaining) [2022-02-20 23:39:09,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (10 of 13 remaining) [2022-02-20 23:39:09,605 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (9 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (8 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (7 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (6 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (5 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (4 of 13 remaining) [2022-02-20 23:39:09,606 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (3 of 13 remaining) [2022-02-20 23:39:09,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (2 of 13 remaining) [2022-02-20 23:39:09,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (1 of 13 remaining) [2022-02-20 23:39:09,607 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-02-20 23:39:09,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:39:09,609 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:39:09,612 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:39:09,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:39:09 BoogieIcfgContainer [2022-02-20 23:39:09,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:39:09,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:39:09,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:39:09,629 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:39:09,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:39:08" (3/4) ... [2022-02-20 23:39:09,631 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:39:09,661 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:39:09,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:39:09,662 INFO L158 Benchmark]: Toolchain (without parser) took 1629.88ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 96.0MB in the beginning and 103.5MB in the end (delta: -7.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,663 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:39:09,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.18ms. Allocated memory is still 125.8MB. Free memory was 95.7MB in the beginning and 100.2MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 125.8MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,664 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 125.8MB. Free memory was 98.6MB in the beginning and 97.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,664 INFO L158 Benchmark]: RCFGBuilder took 314.47ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 83.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,664 INFO L158 Benchmark]: TraceAbstraction took 985.48ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 83.2MB in the beginning and 105.6MB in the end (delta: -22.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,664 INFO L158 Benchmark]: Witness Printer took 32.82ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:39:09,667 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.15ms. Allocated memory is still 125.8MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.18ms. Allocated memory is still 125.8MB. Free memory was 95.7MB in the beginning and 100.2MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 125.8MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 125.8MB. Free memory was 98.6MB in the beginning and 97.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.47ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 83.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 985.48ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 83.2MB in the beginning and 105.6MB in the end (delta: -22.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 32.82ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 103.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: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] int* numbers; [L20] int array_size = __VERIFIER_nondet_int(); [L21] CALL bubbleSort(numbers, array_size) [L5] int i, j, temp; [L7] i = (array_size - 1) VAL [\old(array_size)=2, array_size=2, i=1, numbers={3:4}, numbers={3:4}] [L7] COND TRUE i >= 0 [L8] j = 1 VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={3:4}, numbers={3:4}] [L8] COND TRUE j <= i VAL [\old(array_size)=2, array_size=2, i=1, j=1, numbers={3:4}, numbers={3:4}] [L9] numbers[j-1] - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 10]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 10]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: 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: 18]: 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.9s, OverallIterations: 3, 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, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:39:09,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)