./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i --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/ldv-memsafety/memleaks_test8.i -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 14e73bee1ff131a549474bab511d8101c0585ce83d137ab03c9c7f9d80a198cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:23,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:23,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:23,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:23,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:23,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:23,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:23,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:23,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:23,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:23,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:23,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:23,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:23,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:23,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:23,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:23,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:23,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:23,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:23,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:23,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:23,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:23,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:23,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:23,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:23,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:23,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:23,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:23,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:23,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:23,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:23,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:23,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:23,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:23,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:23,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:23,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:23,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:23,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:23,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:23,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:23,535 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:53:23,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:23,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:23,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:23,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:23,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:23,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:23,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:23,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:23,563 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:23,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:23,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:23,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:23,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:23,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:23,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:23,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:23,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:23,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:23,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:23,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:23,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:23,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:23,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:53:23,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:53:23,567 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 -> 14e73bee1ff131a549474bab511d8101c0585ce83d137ab03c9c7f9d80a198cf [2022-02-20 23:53:23,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:23,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:23,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:23,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:23,802 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:23,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2022-02-20 23:53:23,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea1959ed/7efa87d8ec674b258918539621adce0b/FLAG55580add4 [2022-02-20 23:53:24,342 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:24,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2022-02-20 23:53:24,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea1959ed/7efa87d8ec674b258918539621adce0b/FLAG55580add4 [2022-02-20 23:53:24,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ea1959ed/7efa87d8ec674b258918539621adce0b [2022-02-20 23:53:24,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:24,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:24,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:24,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:24,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:24,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:24" (1/1) ... [2022-02-20 23:53:24,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233ca805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:24, skipping insertion in model container [2022-02-20 23:53:24,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:24" (1/1) ... [2022-02-20 23:53:24,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:24,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:24,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:24,777 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:53:24,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@156aac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:24, skipping insertion in model container [2022-02-20 23:53:24,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:24,782 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:53:24,783 INFO L158 Benchmark]: Toolchain (without parser) took 402.57ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 68.3MB in the end (delta: -3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:53:24,784 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory was 54.0MB in the beginning and 53.9MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:24,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 68.3MB in the end (delta: -3.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:53:24,788 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.22ms. Allocated memory is still 98.6MB. Free memory was 54.0MB in the beginning and 53.9MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.25ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 68.3MB in the end (delta: -3.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/ldv-memsafety/memleaks_test8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 14e73bee1ff131a549474bab511d8101c0585ce83d137ab03c9c7f9d80a198cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:26,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:26,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:26,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:26,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:26,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:26,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:26,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:26,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:26,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:26,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:26,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:26,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:26,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:26,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:26,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:26,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:26,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:26,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:26,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:26,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:26,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:26,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:26,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:26,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:26,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:26,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:26,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:26,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:26,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:26,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:26,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:26,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:26,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:26,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:26,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:26,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:26,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:26,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:26,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:26,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:26,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:53:26,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:26,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:26,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:26,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:26,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:26,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:26,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:26,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:26,467 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:26,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:26,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:26,467 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:26,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:26,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:26,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:26,468 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:26,468 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:53:26,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:26,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:26,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:26,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:26,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:26,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:26,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:26,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:26,477 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:53:26,477 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:53:26,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:53:26,477 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 14e73bee1ff131a549474bab511d8101c0585ce83d137ab03c9c7f9d80a198cf [2022-02-20 23:53:26,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:26,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:26,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:26,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:26,728 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:26,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2022-02-20 23:53:26,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58d4f828/4b0f023e99444b2ca672aec538f96243/FLAG59ec64e76 [2022-02-20 23:53:27,175 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:27,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8.i [2022-02-20 23:53:27,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58d4f828/4b0f023e99444b2ca672aec538f96243/FLAG59ec64e76 [2022-02-20 23:53:27,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58d4f828/4b0f023e99444b2ca672aec538f96243 [2022-02-20 23:53:27,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:27,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:27,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:27,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:27,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:27,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:27" (1/1) ... [2022-02-20 23:53:27,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3781f550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:27, skipping insertion in model container [2022-02-20 23:53:27,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:27" (1/1) ... [2022-02-20 23:53:27,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:27,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:27,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:27,909 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:53:27,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:27,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:27,965 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:53:28,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:28,081 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:53:28,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28 WrapperNode [2022-02-20 23:53:28,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:28,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:28,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:53:28,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:53:28,086 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:53:28" (1/1) ... [2022-02-20 23:53:28,102 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:53:28" (1/1) ... [2022-02-20 23:53:28,114 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 23 [2022-02-20 23:53:28,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:28,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:53:28,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:53:28,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:53:28,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:53:28,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:53:28,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:53:28,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:53:28,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (1/1) ... [2022-02-20 23:53:28,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:28,182 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:53:28,195 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:53:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:53:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:53:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:53:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:53:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:53:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:53:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:53:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:53:28,295 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:53:28,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:53:28,378 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:53:28,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:53:28,382 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:53:28,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:28 BoogieIcfgContainer [2022-02-20 23:53:28,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:53:28,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:53:28,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:53:28,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:53:28,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:27" (1/3) ... [2022-02-20 23:53:28,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a3c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:28, skipping insertion in model container [2022-02-20 23:53:28,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:28" (2/3) ... [2022-02-20 23:53:28,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a3c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:28, skipping insertion in model container [2022-02-20 23:53:28,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:28" (3/3) ... [2022-02-20 23:53:28,400 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test8.i [2022-02-20 23:53:28,403 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:53:28,404 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:53:28,429 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:53:28,433 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:53:28,433 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:53:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:53:28,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:28,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:28,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1492643359, now seen corresponding path program 1 times [2022-02-20 23:53:28,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:28,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470695773] [2022-02-20 23:53:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:28,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:28,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:53:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:28,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:53:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:28,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {25#true} is VALID [2022-02-20 23:53:28,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {25#true} is VALID [2022-02-20 23:53:28,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#true} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {25#true} is VALID [2022-02-20 23:53:28,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} ~size := #in~size; {25#true} is VALID [2022-02-20 23:53:28,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:28,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:28,619 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} {25#true} #33#return; {49#(= (_ bv0 32) |ULTIMATE.start_alloc_8_#t~ret38#1.offset|)} is VALID [2022-02-20 23:53:28,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {49#(= (_ bv0 32) |ULTIMATE.start_alloc_8_#t~ret38#1.offset|)} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {53#(= ~a8~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:28,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {53#(= ~a8~0.offset (_ bv0 32))} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {53#(= ~a8~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:28,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= ~a8~0.offset (_ bv0 32))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {53#(= ~a8~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:28,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= ~a8~0.offset (_ bv0 32))} assume !(0bv32 == ~a8~0.offset); {26#false} is VALID [2022-02-20 23:53:28,623 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:53:28,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:28,624 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:28,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470695773] [2022-02-20 23:53:28,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470695773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:28,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:28,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:28,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640299097] [2022-02-20 23:53:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:53:28,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:28,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:28,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:28,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:28,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:28,692 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:28,792 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 23:53:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:53:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:53:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:53:28,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-02-20 23:53:28,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:28,833 INFO L225 Difference]: With dead ends: 21 [2022-02-20 23:53:28,833 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:53:28,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:28,839 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:28,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:53:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:53:28,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:28,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,860 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,861 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:28,866 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:53:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:53:28,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:28,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:28,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 23:53:28,868 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 23:53:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:28,871 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:53:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:53:28,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:28,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:28,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:28,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:53:28,875 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2022-02-20 23:53:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:28,878 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:53:28,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:53:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:53:28,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:28,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:28,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:29,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:29,087 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -972696078, now seen corresponding path program 1 times [2022-02-20 23:53:29,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:29,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985111457] [2022-02-20 23:53:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:29,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:53:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:29,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:53:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:29,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:29,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:29,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:29,341 INFO L272 TraceCheckUtils]: 2: Hoare triple {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:29,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:29,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {162#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:53:29,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {162#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:53:29,344 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {162#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {149#(bvult (_ bv0 32) |#StackHeapBarrier|)} #33#return; {169#(and (not (= |ULTIMATE.start_alloc_8_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_alloc_8_#t~ret38#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:29,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {169#(and (not (= |ULTIMATE.start_alloc_8_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_alloc_8_#t~ret38#1.base| |#StackHeapBarrier|))} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} is VALID [2022-02-20 23:53:29,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} is VALID [2022-02-20 23:53:29,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} is VALID [2022-02-20 23:53:29,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} assume 0bv32 == ~a8~0.offset; {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} is VALID [2022-02-20 23:53:29,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#(and (bvult ~a8~0.base |#StackHeapBarrier|) (not (= ~a8~0.base (_ bv0 32))))} assume !~bvult32(~a8~0.base, #StackHeapBarrier); {145#false} is VALID [2022-02-20 23:53:29,347 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:53:29,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:29,347 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:29,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985111457] [2022-02-20 23:53:29,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985111457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:29,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:29,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:29,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533089008] [2022-02-20 23:53:29,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:53:29,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:29,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:29,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:53:29,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:53:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:53:29,363 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:29,501 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:53:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:53:29,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:53:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 23:53:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 23:53:29,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 23:53:29,536 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:53:29,537 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:53:29,537 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:53:29,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:53:29,538 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:29,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:53:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-02-20 23:53:29,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:29,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:29,541 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:29,541 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:29,542 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:53:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-20 23:53:29,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:29,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:29,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 29 states. [2022-02-20 23:53:29,547 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 29 states. [2022-02-20 23:53:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:29,549 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 23:53:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-20 23:53:29,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:29,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:29,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:29,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 23:53:29,554 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2022-02-20 23:53:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:29,555 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 23:53:29,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:53:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:53:29,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:29,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:29,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:53:29,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:29,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 770114257, now seen corresponding path program 1 times [2022-02-20 23:53:29,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:29,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695210774] [2022-02-20 23:53:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:29,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:29,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:53:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:29,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:53:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:29,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {298#true} is VALID [2022-02-20 23:53:29,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {298#true} is VALID [2022-02-20 23:53:29,900 INFO L272 TraceCheckUtils]: 2: Hoare triple {298#true} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {298#true} is VALID [2022-02-20 23:53:29,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#true} ~size := #in~size; {298#true} is VALID [2022-02-20 23:53:29,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {315#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:53:29,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {315#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:53:29,902 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {315#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {298#true} #33#return; {322#(and (= |ULTIMATE.start_alloc_8_#t~ret38#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_8_#t~ret38#1.offset|))} is VALID [2022-02-20 23:53:29,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= |ULTIMATE.start_alloc_8_#t~ret38#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_8_#t~ret38#1.offset|))} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {326#(and (= ~a8~0.base (_ bv0 32)) (= ~a8~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:53:29,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#(and (= ~a8~0.base (_ bv0 32)) (= ~a8~0.offset (_ bv0 32)))} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {326#(and (= ~a8~0.base (_ bv0 32)) (= ~a8~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:53:29,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#(and (= ~a8~0.base (_ bv0 32)) (= ~a8~0.offset (_ bv0 32)))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {299#false} is VALID [2022-02-20 23:53:29,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#false} assume 0bv32 == ~a8~0.offset; {299#false} is VALID [2022-02-20 23:53:29,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#false} assume !~bvult32(~a8~0.base, #StackHeapBarrier); {299#false} is VALID [2022-02-20 23:53:29,904 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:53:29,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:29,904 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:29,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695210774] [2022-02-20 23:53:29,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695210774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:29,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:29,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:53:29,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859717011] [2022-02-20 23:53:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:53:29,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:29,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:29,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:29,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:29,916 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:29,996 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:53:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:53:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:53:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-20 23:53:29,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-02-20 23:53:30,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:30,021 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:53:30,021 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 23:53:30,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:30,022 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:30,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 23:53:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-02-20 23:53:30,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:30,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,024 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,025 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,026 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:53:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-20 23:53:30,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 24 states. [2022-02-20 23:53:30,026 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 24 states. [2022-02-20 23:53:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,027 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:53:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-20 23:53:30,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:30,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 23:53:30,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-02-20 23:53:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:30,029 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 23:53:30,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 23:53:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:30,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:30,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:30,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:30,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:30,237 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash -88807295, now seen corresponding path program 1 times [2022-02-20 23:53:30,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:30,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268273657] [2022-02-20 23:53:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:30,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:30,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:30,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:53:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:30,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:53:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:30,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:30,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:53:30,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {437#true} is VALID [2022-02-20 23:53:30,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {437#true} is VALID [2022-02-20 23:53:30,333 INFO L272 TraceCheckUtils]: 2: Hoare triple {437#true} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {437#true} is VALID [2022-02-20 23:53:30,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} ~size := #in~size; {437#true} is VALID [2022-02-20 23:53:30,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {437#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {454#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:53:30,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {454#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:53:30,335 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {454#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {437#true} #33#return; {461#(= (select |#valid| |ULTIMATE.start_alloc_8_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:53:30,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {461#(= (select |#valid| |ULTIMATE.start_alloc_8_#t~ret38#1.base|) (_ bv1 1))} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:30,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:30,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:30,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} assume 0bv32 == ~a8~0.offset; {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:30,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:30,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#(= (select |#valid| ~a8~0.base) (_ bv1 1))} assume !(0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base]); {438#false} is VALID [2022-02-20 23:53:30,338 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:53:30,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:30,338 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:30,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268273657] [2022-02-20 23:53:30,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268273657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:30,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:30,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:30,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370060426] [2022-02-20 23:53:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:30,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:30,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:30,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:30,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:30,355 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,421 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:53:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:53:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-20 23:53:30,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-02-20 23:53:30,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:30,441 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:53:30,441 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:53:30,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:30,442 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:30,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:53:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:53:30,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:30,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,444 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,445 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,445 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:53:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:53:30,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 22 states. [2022-02-20 23:53:30,446 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 22 states. [2022-02-20 23:53:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,447 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:53:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:53:30,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:30,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-02-20 23:53:30,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-02-20 23:53:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:30,449 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-02-20 23:53:30,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:53:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:30,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:30,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:30,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:30,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:30,656 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1896015485, now seen corresponding path program 1 times [2022-02-20 23:53:30,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:30,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618811929] [2022-02-20 23:53:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:30,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:30,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:53:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:30,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:53:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:30,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:30,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {568#true} is VALID [2022-02-20 23:53:30,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,731 INFO L272 TraceCheckUtils]: 2: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {580#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:30,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#(= |old(#valid)| |#valid|)} ~size := #in~size; {580#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:30,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {580#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:30,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#(= |old(#valid)| |#valid|)} assume true; {580#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:30,733 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {580#(= |old(#valid)| |#valid|)} {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #33#return; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32); {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_free_8 } true;~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:30,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {569#false} is VALID [2022-02-20 23:53:30,736 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:53:30,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:30,736 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:30,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618811929] [2022-02-20 23:53:30,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618811929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:30,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:30,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:53:30,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183683834] [2022-02-20 23:53:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:30,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:30,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:30,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:30,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:30,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:30,747 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,793 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-02-20 23:53:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-20 23:53:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-20 23:53:30,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-02-20 23:53:30,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:30,818 INFO L225 Difference]: With dead ends: 25 [2022-02-20 23:53:30,818 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 23:53:30,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:30,819 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:30,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 23:53:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 23:53:30,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:30,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,821 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,822 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,822 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:53:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:53:30,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 23:53:30,823 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 23:53:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:30,824 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:53:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:53:30,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:30,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:30,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:30,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-02-20 23:53:30,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 13 [2022-02-20 23:53:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:30,825 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-02-20 23:53:30,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:53:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:53:30,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:30,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:30,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:53:31,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:31,033 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash 41783673, now seen corresponding path program 1 times [2022-02-20 23:53:31,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:31,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597030239] [2022-02-20 23:53:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:31,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:31,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:31,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:53:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:31,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:53:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:31,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:31,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {686#true} is VALID [2022-02-20 23:53:31,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_8 } true;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {694#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:31,264 INFO L272 TraceCheckUtils]: 2: Hoare triple {694#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset := ldv_malloc(4bv32); {698#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:31,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {698#(= |old(#valid)| |#valid|)} ~size := #in~size; {698#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:31,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {698#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {705#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:53:31,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {705#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:53:31,266 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {705#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {694#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #33#return; {712#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_8_#t~ret38#1.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_8_#t~ret38#1.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:53:31,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_8_#t~ret38#1.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_8_#t~ret38#1.base|)) (_ bv0 1)))} ~a8~0.base, ~a8~0.offset := alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset;havoc alloc_8_#t~ret38#1.base, alloc_8_#t~ret38#1.offset; {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} is VALID [2022-02-20 23:53:31,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} assume { :end_inline_alloc_8 } true;assume { :begin_inline_free_8 } true; {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} is VALID [2022-02-20 23:53:31,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} assume ~a8~0.base != 0bv32 || ~a8~0.offset != 0bv32; {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} is VALID [2022-02-20 23:53:31,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} assume 0bv32 == ~a8~0.offset; {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} is VALID [2022-02-20 23:53:31,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} assume ~bvult32(~a8~0.base, #StackHeapBarrier); {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} is VALID [2022-02-20 23:53:31,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {716#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base v_ArrVal_11) |#valid|)))} assume 0bv32 == ~a8~0.base || 1bv1 == #valid[~a8~0.base];call ULTIMATE.dealloc(~a8~0.base, ~a8~0.offset); {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} is VALID [2022-02-20 23:53:31,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} assume { :end_inline_free_8 } true;~a8~0.base, ~a8~0.offset := 0bv32, 0bv32; {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} is VALID [2022-02-20 23:53:31,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} assume { :end_inline_entry_point } true; {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} is VALID [2022-02-20 23:53:31,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {732#(exists ((~a8~0.base (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| ~a8~0.base (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a8~0.base)))))} assume !(#valid == main_old_#valid#1); {687#false} is VALID [2022-02-20 23:53:31,273 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:53:31,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:31,273 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:31,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597030239] [2022-02-20 23:53:31,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597030239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:31,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:31,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:53:31,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272997341] [2022-02-20 23:53:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:31,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:53:31,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:31,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:31,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:31,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:53:31,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:53:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:31,291 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:31,332 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 23:53:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:53:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:53:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-02-20 23:53:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-02-20 23:53:31,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 16 transitions. [2022-02-20 23:53:31,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:31,349 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:53:31,349 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:53:31,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:31,350 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:31,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-02-20 23:53:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:53:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:53:31,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:31,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:53:31,351 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:53:31,351 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:53:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:31,351 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:31,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:31,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:31,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 23:53:31,351 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 23:53:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:31,351 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:31,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:31,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:31,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:31,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:53:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:53:31,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 23:53:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:31,352 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:53:31,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:31,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:31,353 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2022-02-20 23:53:31,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:53:31,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:53:31,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2022-02-20 23:53:31,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:53:31,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:31,562 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 23:53:31,563 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:53:31,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:53:31 BoogieIcfgContainer [2022-02-20 23:53:31,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:53:31,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:53:31,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:53:31,565 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:53:31,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:28" (3/4) ... [2022-02-20 23:53:31,567 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:53:31,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 23:53:31,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 23:53:31,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:53:31,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:53:31,592 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:53:31,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:53:31,592 INFO L158 Benchmark]: Toolchain (without parser) took 4041.25ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 30.3MB in the beginning and 38.7MB in the end (delta: -8.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,593 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:31,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.05ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.1MB in the beginning and 46.4MB in the end (delta: -16.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 71.3MB. Free memory was 46.4MB in the beginning and 44.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,593 INFO L158 Benchmark]: Boogie Preprocessor took 21.75ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 42.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,593 INFO L158 Benchmark]: RCFGBuilder took 246.85ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 50.8MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,595 INFO L158 Benchmark]: TraceAbstraction took 3180.45ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.5MB in the beginning and 41.5MB in the end (delta: 9.0MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,595 INFO L158 Benchmark]: Witness Printer took 26.37ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 38.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:31,596 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.19ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.6MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.05ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.1MB in the beginning and 46.4MB in the end (delta: -16.3MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 71.3MB. Free memory was 46.4MB in the beginning and 44.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.75ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 42.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 246.85ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 50.8MB in the end (delta: -8.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3180.45ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.5MB in the beginning and 41.5MB in the end (delta: 9.0MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Witness Printer took 26.37ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 38.7MB in the end (delta: 2.8MB). 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 - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 96 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 71 ConstructedInterpolants, 11 QuantifiedInterpolants, 373 SizeOfPredicates, 1 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:53:31,619 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 Result: TRUE