./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test16.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_test16.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 c11af8296bfd5ac190948fd112a042e269f74b0ed21dcbb0764a4b3dab5067a3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:00,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:00,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:00,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:00,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:00,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:00,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:00,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:00,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:00,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:00,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:00,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:00,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:00,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:00,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:00,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:00,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:00,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:00,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:00,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:00,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:00,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:00,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:00,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:00,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:00,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:00,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:00,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:00,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:00,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:00,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:00,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:00,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:00,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:00,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:00,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:00,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:00,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:00,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:00,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:00,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:00,398 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:51:00,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:00,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:00,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:00,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:00,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:00,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:00,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:00,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:00,438 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:00,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:00,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:00,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:00,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:00,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:00,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:00,440 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:00,440 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:00,440 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:00,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:00,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:00,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:00,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:00,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:00,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:00,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:00,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:00,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:00,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:00,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:00,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:00,443 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 -> c11af8296bfd5ac190948fd112a042e269f74b0ed21dcbb0764a4b3dab5067a3 [2022-02-20 23:51:00,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:00,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:00,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:00,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:00,676 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:00,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2022-02-20 23:51:00,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3aa263f/5fe1a0a1fedf4c26aecdb14cd1dce75f/FLAG587845669 [2022-02-20 23:51:01,124 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:01,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2022-02-20 23:51:01,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3aa263f/5fe1a0a1fedf4c26aecdb14cd1dce75f/FLAG587845669 [2022-02-20 23:51:01,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3aa263f/5fe1a0a1fedf4c26aecdb14cd1dce75f [2022-02-20 23:51:01,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:01,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:01,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:01,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:01,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:01,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:01" (1/1) ... [2022-02-20 23:51:01,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8f6bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:01, skipping insertion in model container [2022-02-20 23:51:01,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:01" (1/1) ... [2022-02-20 23:51:01,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:01,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:01,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:01,936 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:51:01,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ba6c89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:01, skipping insertion in model container [2022-02-20 23:51:01,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:01,938 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:51:01,941 INFO L158 Benchmark]: Toolchain (without parser) took 465.22ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.8MB in the beginning and 76.1MB in the end (delta: -24.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:51:01,942 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:01,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.85ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 76.1MB in the end (delta: -24.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:51:01,944 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.18ms. Allocated memory is still 86.0MB. Free memory was 40.5MB in the beginning and 40.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.85ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 76.1MB in the end (delta: -24.4MB). Peak memory consumption was 10.5MB. 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_test16.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 c11af8296bfd5ac190948fd112a042e269f74b0ed21dcbb0764a4b3dab5067a3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:03,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:03,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:03,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:03,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:03,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:03,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:03,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:03,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:03,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:03,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:03,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:03,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:03,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:03,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:03,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:03,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:03,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:03,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:03,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:03,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:03,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:03,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:03,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:03,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:03,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:03,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:03,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:03,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:03,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:03,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:03,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:03,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:03,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:03,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:03,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:03,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:03,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:03,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:03,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:03,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:03,740 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:51:03,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:03,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:03,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:03,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:03,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:03,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:03,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:03,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:03,770 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:03,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:03,771 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:03,772 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:03,773 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:03,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:03,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:03,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:03,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:03,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:03,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:03,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:03,783 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:03,783 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:03,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:03,784 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 -> c11af8296bfd5ac190948fd112a042e269f74b0ed21dcbb0764a4b3dab5067a3 [2022-02-20 23:51:04,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:04,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:04,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:04,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:04,095 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:04,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2022-02-20 23:51:04,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a17c2303/08ceee9b29934e328a2c5b8f19a971f8/FLAGb24328913 [2022-02-20 23:51:04,610 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:04,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2022-02-20 23:51:04,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a17c2303/08ceee9b29934e328a2c5b8f19a971f8/FLAGb24328913 [2022-02-20 23:51:04,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a17c2303/08ceee9b29934e328a2c5b8f19a971f8 [2022-02-20 23:51:04,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:04,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:04,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:04,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:04,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:04,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:04" (1/1) ... [2022-02-20 23:51:04,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ee46d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:04, skipping insertion in model container [2022-02-20 23:51:04,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:04" (1/1) ... [2022-02-20 23:51:04,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:04,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:05,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:05,442 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:05,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:05,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:05,537 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:05,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:05,660 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:05,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05 WrapperNode [2022-02-20 23:51:05,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:05,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:05,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:05,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:05,668 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:51:05" (1/1) ... [2022-02-20 23:51:05,704 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:51:05" (1/1) ... [2022-02-20 23:51:05,726 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 33 [2022-02-20 23:51:05,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:05,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:05,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:05,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:05,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:05,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:05,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:05,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:05,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:05,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:05,813 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:51:05,825 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:51:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:06,017 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:06,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:06,153 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:06,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:06,159 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:51:06,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:06 BoogieIcfgContainer [2022-02-20 23:51:06,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:06,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:06,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:06,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:51:04" (1/3) ... [2022-02-20 23:51:06,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30399027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:06, skipping insertion in model container [2022-02-20 23:51:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05" (2/3) ... [2022-02-20 23:51:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30399027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:06, skipping insertion in model container [2022-02-20 23:51:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:06" (3/3) ... [2022-02-20 23:51:06,168 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test16.i [2022-02-20 23:51:06,172 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:06,172 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:51:06,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:06,213 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:51:06,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:51:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.4375) internal successors, (23), 20 states have internal predecessors, (23), 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:51:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:51:06,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:06,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:51:06,239 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:51:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1067130598, now seen corresponding path program 1 times [2022-02-20 23:51:06,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:06,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23611602] [2022-02-20 23:51:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:06,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:06,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:06,265 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:51:06,267 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:51:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:51:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:06,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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); {26#true} is VALID [2022-02-20 23:51:06,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {34#(= |ULTIMATE.start_alloc_16_~condition#1| |ULTIMATE.start_entry_point_~condition~0#1|)} is VALID [2022-02-20 23:51:06,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#(= |ULTIMATE.start_alloc_16_~condition#1| |ULTIMATE.start_entry_point_~condition~0#1|)} assume !(0bv32 != alloc_16_~condition#1);alloc_16_#res#1.base, alloc_16_#res#1.offset := 0bv32, 0bv32; {38#(= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32))} is VALID [2022-02-20 23:51:06,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#(= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {42#(= |ULTIMATE.start_free_16_~condition#1| (_ bv0 32))} is VALID [2022-02-20 23:51:06,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#(= |ULTIMATE.start_free_16_~condition#1| (_ bv0 32))} assume 0bv32 != free_16_~condition#1; {27#false} is VALID [2022-02-20 23:51:06,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume !(0bv32 == free_16_~p#1.offset); {27#false} is VALID [2022-02-20 23:51:06,509 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:51:06,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:06,510 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:06,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23611602] [2022-02-20 23:51:06,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23611602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:06,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:06,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:06,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895485199] [2022-02-20 23:51:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:06,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:51:06,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:06,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:51:06,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:06,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:06,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:06,570 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.4375) internal successors, (23), 20 states have internal predecessors, (23), 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, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:51:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,768 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-20 23:51:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:51:06,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:51:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:51:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 23:51:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:51:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 23:51:06,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 23:51:06,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:06,840 INFO L225 Difference]: With dead ends: 37 [2022-02-20 23:51:06,850 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:51:06,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:06,859 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:06,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 67 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:51:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-02-20 23:51:06,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:06,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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:51:06,885 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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:51:06,885 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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:51:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,888 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:51:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:51:06,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:06,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:06,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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 31 states. [2022-02-20 23:51:06,890 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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 31 states. [2022-02-20 23:51:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,892 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:51:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:51:06,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:06,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:06,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:06,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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:51:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-20 23:51:06,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2022-02-20 23:51:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:06,897 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-20 23:51:06,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:51:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-20 23:51:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:51:06,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:06,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:06,910 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:51:07,110 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:51:07,111 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -984431063, now seen corresponding path program 1 times [2022-02-20 23:51:07,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:07,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523264434] [2022-02-20 23:51:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:07,114 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:51:07,116 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:51:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:51:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:07,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#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); {176#true} is VALID [2022-02-20 23:51:07,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(0bv32 != alloc_16_~condition#1);alloc_16_#res#1.base, alloc_16_#res#1.offset := 0bv32, 0bv32; {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(0bv32 != free_16_~condition#1); {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_free_16 } true; {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:07,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {177#false} is VALID [2022-02-20 23:51:07,216 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:51:07,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:07,217 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:07,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523264434] [2022-02-20 23:51:07,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523264434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:07,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:07,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:51:07,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843651889] [2022-02-20 23:51:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:51:07,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:07,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:51:07,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:07,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:51:07,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:51:07,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:51:07,232 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:51:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,295 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:51:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:51:07,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:51:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:51:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-20 23:51:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:51:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-20 23:51:07,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-02-20 23:51:07,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:07,341 INFO L225 Difference]: With dead ends: 26 [2022-02-20 23:51:07,341 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 23:51:07,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:51:07,342 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:07,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 23:51:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 23:51:07,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:07,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:51:07,346 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:51:07,346 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:51:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,348 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 23:51:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 23:51:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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 21 states. [2022-02-20 23:51:07,349 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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 21 states. [2022-02-20 23:51:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,351 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 23:51:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 23:51:07,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:07,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:51:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 23:51:07,357 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 8 [2022-02-20 23:51:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:07,357 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 23:51:07,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:51:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 23:51:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:07,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:07,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:07,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:07,566 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:51:07,567 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1513552230, now seen corresponding path program 1 times [2022-02-20 23:51:07,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:07,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369707688] [2022-02-20 23:51:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:07,570 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:51:07,571 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:51:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:51:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:07,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#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); {291#true} is VALID [2022-02-20 23:51:07,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {291#true} is VALID [2022-02-20 23:51:07,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume 0bv32 != alloc_16_~condition#1; {291#true} is VALID [2022-02-20 23:51:07,690 INFO L272 TraceCheckUtils]: 3: Hoare triple {291#true} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {291#true} is VALID [2022-02-20 23:51:07,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {291#true} ~size := #in~size; {291#true} is VALID [2022-02-20 23:51:07,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {291#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; {311#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {311#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,693 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {311#(= |ldv_malloc_#res.offset| (_ bv0 32))} {291#true} #38#return; {318#(= |ULTIMATE.start_alloc_16_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {318#(= |ULTIMATE.start_alloc_16_#t~ret38#1.offset| (_ bv0 32))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {322#(= |ULTIMATE.start_alloc_16_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {322#(= |ULTIMATE.start_alloc_16_#res#1.offset| (_ bv0 32))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {326#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {326#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} assume 0bv32 != free_16_~condition#1; {326#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:07,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} assume !(0bv32 == free_16_~p#1.offset); {292#false} is VALID [2022-02-20 23:51:07,695 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:51:07,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:07,695 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:07,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369707688] [2022-02-20 23:51:07,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369707688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:07,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:07,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:07,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616922535] [2022-02-20 23:51:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:07,698 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), 5 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:51:07,716 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:51:07,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:51:07,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:51:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:51:07,718 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,825 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 23:51:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:51:07,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 23:51:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 23:51:07,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-02-20 23:51:07,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:07,852 INFO L225 Difference]: With dead ends: 20 [2022-02-20 23:51:07,852 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 23:51:07,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:07,853 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:07,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 23:51:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 23:51:07,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:07,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:51:07,856 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:51:07,856 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:51:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,857 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 23:51:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 23:51:07,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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 20 states. [2022-02-20 23:51:07,858 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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 20 states. [2022-02-20 23:51:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,860 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 23:51:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 23:51:07,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:07,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:51:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 23:51:07,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-02-20 23:51:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:07,863 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 23:51:07,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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:51:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 23:51:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:51:07,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:07,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:07,879 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:51:08,072 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:51:08,073 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -324521072, now seen corresponding path program 1 times [2022-02-20 23:51:08,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:08,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491683645] [2022-02-20 23:51:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:08,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:08,075 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:51:08,077 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:51:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:51:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:08,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#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); {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(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;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != alloc_16_~condition#1; {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,282 INFO L272 TraceCheckUtils]: 3: Hoare triple {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#(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; {435#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {435#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,285 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {435#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {419#(bvult (_ bv0 32) |#StackHeapBarrier|)} #38#return; {442#(and (bvult |ULTIMATE.start_alloc_16_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {442#(and (bvult |ULTIMATE.start_alloc_16_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32))))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {446#(and (not (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|)) (bvult |ULTIMATE.start_alloc_16_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:51:08,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#(and (not (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|)) (bvult |ULTIMATE.start_alloc_16_#res#1.base| |#StackHeapBarrier|))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume 0bv32 != free_16_~condition#1; {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume 0bv32 == free_16_~p#1.offset; {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:08,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume !~bvult32(free_16_~p#1.base, #StackHeapBarrier); {415#false} is VALID [2022-02-20 23:51:08,289 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:51:08,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:08,289 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:08,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491683645] [2022-02-20 23:51:08,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491683645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:08,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:08,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:08,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495276993] [2022-02-20 23:51:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:08,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,306 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:51:08,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:08,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:08,308 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,546 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:51:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:51:08,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-02-20 23:51:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-02-20 23:51:08,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-02-20 23:51:08,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:08,587 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:51:08,587 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:51:08,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:08,589 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:08,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 57 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:51:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-02-20 23:51:08,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:08,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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:51:08,592 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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:51:08,592 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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:51:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,594 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:51:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 23:51:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:08,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:08,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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 33 states. [2022-02-20 23:51:08,595 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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 33 states. [2022-02-20 23:51:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,597 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 23:51:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 23:51:08,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:08,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:08,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:08,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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:51:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 23:51:08,599 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2022-02-20 23:51:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:08,600 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 23:51:08,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:51:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:51:08,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:08,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:08,615 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:51:08,813 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:51:08,814 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1418289263, now seen corresponding path program 1 times [2022-02-20 23:51:08,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:08,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113172543] [2022-02-20 23:51:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:08,816 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:51:08,818 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:51:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:09,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {587#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); {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:09,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#(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;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:09,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != alloc_16_~condition#1; {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:09,007 INFO L272 TraceCheckUtils]: 3: Hoare triple {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:09,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:09,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {608#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:09,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {608#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:09,010 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {608#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {592#(bvult (_ bv0 32) |#StackHeapBarrier|)} #38#return; {615#(and (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32)) (bvult (_ bv0 32) |#StackHeapBarrier|))} is VALID [2022-02-20 23:51:09,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {615#(and (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32)) (bvult (_ bv0 32) |#StackHeapBarrier|))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {619#(and (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|) (bvult (_ bv0 32) |#StackHeapBarrier|))} is VALID [2022-02-20 23:51:09,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(and (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|) (bvult (_ bv0 32) |#StackHeapBarrier|))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:09,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume 0bv32 != free_16_~condition#1; {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:09,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume 0bv32 == free_16_~p#1.offset; {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:09,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume !~bvult32(free_16_~p#1.base, #StackHeapBarrier); {588#false} is VALID [2022-02-20 23:51:09,016 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:51:09,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:09,016 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:09,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113172543] [2022-02-20 23:51:09,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113172543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:09,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:09,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:09,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118215448] [2022-02-20 23:51:09,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:09,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:09,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,037 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:51:09,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:09,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:09,039 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,225 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 23:51:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:51:09,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:51:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:51:09,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 23:51:09,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:09,260 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:51:09,260 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:51:09,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:09,262 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:09,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:51:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-02-20 23:51:09,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:09,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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:51:09,265 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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:51:09,265 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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:51:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,266 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 23:51:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 23:51:09,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 31 states. [2022-02-20 23:51:09,267 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 31 states. [2022-02-20 23:51:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,269 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 23:51:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 23:51:09,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:09,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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:51:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 23:51:09,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2022-02-20 23:51:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:09,271 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 23:51:09,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:51:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 23:51:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:51:09,272 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:09,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:09,481 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:51:09,481 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1470218584, now seen corresponding path program 1 times [2022-02-20 23:51:09,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:09,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534814138] [2022-02-20 23:51:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:09,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:09,484 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:51:09,484 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:51:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:09,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:09,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:09,567 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:51:09,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {754#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); {754#true} is VALID [2022-02-20 23:51:09,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {754#true} is VALID [2022-02-20 23:51:09,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume 0bv32 != alloc_16_~condition#1; {754#true} is VALID [2022-02-20 23:51:09,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {754#true} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {754#true} is VALID [2022-02-20 23:51:09,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {754#true} ~size := #in~size; {754#true} is VALID [2022-02-20 23:51:09,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#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; {774#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:09,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {774#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:09,619 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {774#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {754#true} #38#return; {781#(= (select |#valid| |ULTIMATE.start_alloc_16_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:09,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(= (select |#valid| |ULTIMATE.start_alloc_16_#t~ret38#1.base|) (_ bv1 1))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {785#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_16_#res#1.base|))} is VALID [2022-02-20 23:51:09,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {785#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_16_#res#1.base|))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:09,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} assume 0bv32 != free_16_~condition#1; {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:09,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} assume 0bv32 == free_16_~p#1.offset; {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:09,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} assume ~bvult32(free_16_~p#1.base, #StackHeapBarrier); {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:09,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#(= (select |#valid| |ULTIMATE.start_free_16_~p#1.base|) (_ bv1 1))} assume !(0bv32 == free_16_~p#1.base || 1bv1 == #valid[free_16_~p#1.base]); {755#false} is VALID [2022-02-20 23:51:09,622 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:51:09,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:09,622 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:09,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534814138] [2022-02-20 23:51:09,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534814138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:09,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:09,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:09,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483690914] [2022-02-20 23:51:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-02-20 23:51:09,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:09,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:09,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:09,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:51:09,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:51:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:51:09,635 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,747 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:51:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-02-20 23:51:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 23:51:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 23:51:09,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 23:51:09,788 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:51:09,789 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:51:09,789 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:51:09,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:09,791 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:09,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 55 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:51:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2022-02-20 23:51:09,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:09,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:51:09,798 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:51:09,798 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:51:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,799 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 23:51:09,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 30 states. [2022-02-20 23:51:09,804 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 30 states. [2022-02-20 23:51:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,806 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 23:51:09,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:09,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:51:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 23:51:09,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-02-20 23:51:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:09,808 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 23:51:09,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 23:51:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:51:09,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:09,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:09,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:10,018 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:51:10,019 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1469972311, now seen corresponding path program 1 times [2022-02-20 23:51:10,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:10,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770428050] [2022-02-20 23:51:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:10,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:10,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:51:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:51:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:10,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#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); {911#true} is VALID [2022-02-20 23:51:10,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {919#(= |ULTIMATE.start_alloc_16_~condition#1| |ULTIMATE.start_entry_point_~condition~0#1|)} is VALID [2022-02-20 23:51:10,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#(= |ULTIMATE.start_alloc_16_~condition#1| |ULTIMATE.start_entry_point_~condition~0#1|)} assume 0bv32 != alloc_16_~condition#1; {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:10,132 INFO L272 TraceCheckUtils]: 3: Hoare triple {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {911#true} is VALID [2022-02-20 23:51:10,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {911#true} ~size := #in~size; {911#true} is VALID [2022-02-20 23:51:10,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {911#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; {911#true} is VALID [2022-02-20 23:51:10,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#true} assume true; {911#true} is VALID [2022-02-20 23:51:10,133 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {911#true} {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} #38#return; {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:10,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:10,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(not (= |ULTIMATE.start_entry_point_~condition~0#1| (_ bv0 32)))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {945#(not (= |ULTIMATE.start_free_16_~condition#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:10,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#(not (= |ULTIMATE.start_free_16_~condition#1| (_ bv0 32)))} assume !(0bv32 != free_16_~condition#1); {912#false} is VALID [2022-02-20 23:51:10,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#false} assume { :end_inline_free_16 } true; {912#false} is VALID [2022-02-20 23:51:10,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#false} assume { :end_inline_entry_point } true; {912#false} is VALID [2022-02-20 23:51:10,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#false} assume !(#valid == main_old_#valid#1); {912#false} is VALID [2022-02-20 23:51:10,135 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:51:10,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:10,135 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:10,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770428050] [2022-02-20 23:51:10,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770428050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:10,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:10,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:10,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845496720] [2022-02-20 23:51:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-02-20 23:51:10,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:10,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:10,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:10,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:10,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:10,152 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,210 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:51:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-02-20 23:51:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-20 23:51:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-20 23:51:10,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-02-20 23:51:10,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:10,229 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:51:10,229 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:51:10,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:10,230 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:10,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:51:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:51:10,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:10,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:51:10,233 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:51:10,233 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:51:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,234 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:51:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:51:10,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:10,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:10,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 18 states. [2022-02-20 23:51:10,235 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 18 states. [2022-02-20 23:51:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,236 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:51:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:51:10,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:10,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:10,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:10,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:51:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 23:51:10,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-02-20 23:51:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:10,238 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 23:51:10,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:51:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:51:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:51:10,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:10,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:10,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:51:10,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,447 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 794708311, now seen corresponding path program 1 times [2022-02-20 23:51:10,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:10,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073786358] [2022-02-20 23:51:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:10,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:10,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:51:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:51:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:10,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#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); {1033#true} is VALID [2022-02-20 23:51:10,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {1041#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:10,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1041#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume 0bv32 != alloc_16_~condition#1; {1041#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:10,766 INFO L272 TraceCheckUtils]: 3: Hoare triple {1041#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {1048#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:10,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |old(#valid)| |#valid|)} ~size := #in~size; {1048#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:10,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(= |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; {1055#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:51:10,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} assume true; {1055#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:51:10,770 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1055#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} {1041#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #38#return; {1062#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#t~ret38#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#t~ret38#1.base|))))} is VALID [2022-02-20 23:51:10,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1062#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#t~ret38#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#t~ret38#1.base|))))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {1066#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#res#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#res#1.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:51:10,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#res#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_16_#res#1.base| v_ArrVal_13) |#valid|)))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} is VALID [2022-02-20 23:51:10,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} assume 0bv32 != free_16_~condition#1; {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} is VALID [2022-02-20 23:51:10,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} assume 0bv32 == free_16_~p#1.offset; {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} is VALID [2022-02-20 23:51:10,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} assume ~bvult32(free_16_~p#1.base, #StackHeapBarrier); {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} is VALID [2022-02-20 23:51:10,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {1070#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))))} assume 0bv32 == free_16_~p#1.base || 1bv1 == #valid[free_16_~p#1.base];call ULTIMATE.dealloc(free_16_~p#1.base, free_16_~p#1.offset); {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:51:10,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_free_16 } true; {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:51:10,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_entry_point } true; {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:51:10,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {1083#(exists ((|ULTIMATE.start_free_16_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_16_~p#1.base| (_ bv0 1)) |#valid|)))} assume !(#valid == main_old_#valid#1); {1034#false} is VALID [2022-02-20 23:51:10,777 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:51:10,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:10,778 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:10,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073786358] [2022-02-20 23:51:10,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073786358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:10,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:10,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:51:10,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395293400] [2022-02-20 23:51:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 17 [2022-02-20 23:51:10,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:10,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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:51:10,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:10,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:51:10,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:51:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:51:10,804 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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:51:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,890 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:51:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 17 [2022-02-20 23:51:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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:51:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-02-20 23:51:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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:51:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-02-20 23:51:10,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-02-20 23:51:10,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:10,923 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:51:10,923 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:51:10,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:51:10,924 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:10,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-02-20 23:51:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:51:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:51:10,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:10,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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:51:10,926 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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:51:10,926 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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:51:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,927 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:51:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:51:10,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:10,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:10,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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 18 states. [2022-02-20 23:51:10,928 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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 18 states. [2022-02-20 23:51:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:10,928 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:51:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:51:10,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:10,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:10,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:10,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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:51:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-02-20 23:51:10,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 17 [2022-02-20 23:51:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:10,930 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-02-20 23:51:10,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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:51:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:51:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:51:10,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:10,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:10,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:11,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:11,139 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 923791030, now seen corresponding path program 1 times [2022-02-20 23:51:11,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:11,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673821677] [2022-02-20 23:51:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:11,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:11,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:51:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:51:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:11,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:11,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {1175#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); {1180#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {1180#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_16 } true;alloc_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_16_#res#1.base, alloc_16_#res#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset, alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset, alloc_16_~condition#1;alloc_16_~condition#1 := alloc_16_#in~condition#1; {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume 0bv32 != alloc_16_~condition#1; {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,388 INFO L272 TraceCheckUtils]: 3: Hoare triple {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} call alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset := ldv_malloc(4bv32); {1191#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:11,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {1191#(= |old(#valid)| |#valid|)} ~size := #in~size; {1191#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:11,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1198#(and (= |old(#valid)| |#valid|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1198#(and (= |old(#valid)| |#valid|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1198#(and (= |old(#valid)| |#valid|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,391 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1198#(and (= |old(#valid)| |#valid|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} #38#return; {1205#(and (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1205#(and (= |ULTIMATE.start_alloc_16_#t~ret38#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset := alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;havoc alloc_16_#t~ret38#1.base, alloc_16_#t~ret38#1.offset;alloc_16_#res#1.base, alloc_16_#res#1.offset := alloc_16_~p~0#1.base, alloc_16_~p~0#1.offset; {1209#(and (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1209#(and (= (_ bv0 32) |ULTIMATE.start_alloc_16_#res#1.base|) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_16_#res#1.base, alloc_16_#res#1.offset;assume { :end_inline_alloc_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 != free_16_~condition#1; {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == free_16_~p#1.offset; {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume ~bvult32(free_16_~p#1.base, #StackHeapBarrier); {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#(and (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)) (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == free_16_~p#1.base || 1bv1 == #valid[free_16_~p#1.base];call ULTIMATE.dealloc(free_16_~p#1.base, free_16_~p#1.offset); {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume { :end_inline_free_16 } true; {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume { :end_inline_entry_point } true; {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:51:11,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {1184#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume !(#valid == main_old_#valid#1); {1176#false} is VALID [2022-02-20 23:51:11,398 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:51:11,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:11,398 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:11,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673821677] [2022-02-20 23:51:11,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673821677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:11,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:11,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:11,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528610798] [2022-02-20 23:51:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:11,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 17 [2022-02-20 23:51:11,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:11,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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:51:11,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:11,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:51:11,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:11,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:51:11,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:51:11,415 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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:51:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,527 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:51:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 17 [2022-02-20 23:51:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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:51:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2022-02-20 23:51:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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:51:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2022-02-20 23:51:11,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 17 transitions. [2022-02-20 23:51:11,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:11,545 INFO L225 Difference]: With dead ends: 17 [2022-02-20 23:51:11,545 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:51:11,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:51:11,546 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:11,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:51:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:51:11,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:11,547 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:51:11,547 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:51:11,547 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:51:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,547 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:51:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:51:11,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,547 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:51:11,547 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:51:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:11,548 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:51:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:51:11,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:11,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:11,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:11,548 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:51:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:51:11,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 23:51:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:11,548 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:51:11,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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:51:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:51:11,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:11,550 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2022-02-20 23:51:11,551 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:51:11,551 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:51:11,551 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2022-02-20 23:51:11,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:11,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:11,757 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:11,758 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:51:11,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:51:11 BoogieIcfgContainer [2022-02-20 23:51:11,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:51:11,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:51:11,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:51:11,761 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:51:11,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:06" (3/4) ... [2022-02-20 23:51:11,763 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:51:11,768 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 23:51:11,771 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 23:51:11,771 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 23:51:11,771 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:51:11,797 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:51:11,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:51:11,799 INFO L158 Benchmark]: Toolchain (without parser) took 6849.59ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 30.1MB in the beginning and 37.8MB in the end (delta: -7.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,799 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:11,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.28ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 44.4MB in the end (delta: -14.6MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.73ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,799 INFO L158 Benchmark]: Boogie Preprocessor took 49.67ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 40.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,800 INFO L158 Benchmark]: RCFGBuilder took 383.35ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 45.9MB in the end (delta: -5.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,800 INFO L158 Benchmark]: TraceAbstraction took 5597.69ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 39.9MB in the end (delta: 5.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,800 INFO L158 Benchmark]: Witness Printer took 37.09ms. Allocated memory is still 83.9MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:51:11,801 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 is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.28ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 44.4MB in the end (delta: -14.6MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.73ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.67ms. Allocated memory is still 69.2MB. Free memory was 42.1MB in the beginning and 40.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.35ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 45.9MB in the end (delta: -5.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5597.69ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 39.9MB in the end (delta: 5.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 37.09ms. Allocated memory is still 83.9MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: 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, 23 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 154 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 58, 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, 9 MinimizatonAttempts, 30 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 11 QuantifiedInterpolants, 569 SizeOfPredicates, 34 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:51:11,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE