./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.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_test21-2.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 8cad73f64954eeb86e2707e579f8aca932182fe823da421e8ece02d4d63f0cc3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:51,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:51,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:51,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:51,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:51,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:51,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:51,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:51,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:51,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:51,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:51,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:51,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:51,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:51,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:51,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:51,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:51,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:51,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:51,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:51,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:51,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:51,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:51,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:51,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:51,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:51,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:51,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:51,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:51,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:51,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:51,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:51,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:51,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:51,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:51,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:51,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:51,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:51,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:51,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:51,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:51,761 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:51,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:51,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:51,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:51,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:51,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:51,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:51,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:51,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:51,790 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:51,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:51,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:51,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:51,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:51,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:51,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:51,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:51,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:51,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:51,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:51,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:51,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:51,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:51,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:51,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:51,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:51,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:51,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:51,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:51,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:51,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:51,797 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 -> 8cad73f64954eeb86e2707e579f8aca932182fe823da421e8ece02d4d63f0cc3 [2022-02-20 23:51:52,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:52,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:52,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:52,051 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:52,053 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:52,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2022-02-20 23:51:52,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d90586b3/f23388672cf1446b89d8e2969a6a4f9b/FLAGd0c2fe131 [2022-02-20 23:51:52,496 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:52,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2022-02-20 23:51:52,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d90586b3/f23388672cf1446b89d8e2969a6a4f9b/FLAGd0c2fe131 [2022-02-20 23:51:52,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d90586b3/f23388672cf1446b89d8e2969a6a4f9b [2022-02-20 23:51:52,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:52,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:52,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:52,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:52,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:52,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:52" (1/1) ... [2022-02-20 23:51:52,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9557fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:52, skipping insertion in model container [2022-02-20 23:51:52,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:52" (1/1) ... [2022-02-20 23:51:52,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:52,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:53,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:53,315 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:53,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f3bb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:53, skipping insertion in model container [2022-02-20 23:51:53,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:53,316 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:51:53,318 INFO L158 Benchmark]: Toolchain (without parser) took 463.56ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 68.1MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:51:53,318 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:53,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.42ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 68.1MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:51:53,320 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 96.5MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.42ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 68.1MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. 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_test21-2.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 8cad73f64954eeb86e2707e579f8aca932182fe823da421e8ece02d4d63f0cc3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:55,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:55,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:55,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:55,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:55,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:55,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:55,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:55,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:55,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:55,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:55,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:55,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:55,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:55,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:55,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:55,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:55,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:55,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:55,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:55,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:55,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:55,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:55,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:55,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:55,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:55,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:55,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:55,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:55,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:55,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:55,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:55,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:55,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:55,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:55,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:55,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:55,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:55,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:55,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:55,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:55,219 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:55,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:55,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:55,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:55,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:55,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:55,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:55,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:55,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:55,265 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:55,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:55,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:55,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:55,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:55,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:55,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:55,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:55,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:55,268 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:55,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:55,269 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:55,269 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:55,269 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:55,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:55,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:55,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:55,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:55,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:55,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:55,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:55,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:55,271 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:55,271 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:55,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:55,272 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 -> 8cad73f64954eeb86e2707e579f8aca932182fe823da421e8ece02d4d63f0cc3 [2022-02-20 23:51:55,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:55,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:55,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:55,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:55,655 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:55,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2022-02-20 23:51:55,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13111e9cf/d2b68d5f5cf64956812042b437a4faba/FLAG2dc86be6d [2022-02-20 23:51:56,246 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:56,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2022-02-20 23:51:56,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13111e9cf/d2b68d5f5cf64956812042b437a4faba/FLAG2dc86be6d [2022-02-20 23:51:56,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13111e9cf/d2b68d5f5cf64956812042b437a4faba [2022-02-20 23:51:56,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:56,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:56,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:56,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:56,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:56,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:56" (1/1) ... [2022-02-20 23:51:56,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e556f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:56, skipping insertion in model container [2022-02-20 23:51:56,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:56" (1/1) ... [2022-02-20 23:51:56,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:56,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:56,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:56,978 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:56,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:57,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:57,040 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:57,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:57,122 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:57,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:57 WrapperNode [2022-02-20 23:51:57,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:57,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:57,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:57,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:57,130 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:57" (1/1) ... [2022-02-20 23:51:57,155 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:57" (1/1) ... [2022-02-20 23:51:57,189 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 31 [2022-02-20 23:51:57,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:57,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:57,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:57,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:57,197 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:57" (1/1) ... [2022-02-20 23:51:57,198 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:57" (1/1) ... [2022-02-20 23:51:57,208 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:57" (1/1) ... [2022-02-20 23:51:57,208 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:57" (1/1) ... [2022-02-20 23:51:57,222 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:57" (1/1) ... [2022-02-20 23:51:57,232 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:57" (1/1) ... [2022-02-20 23:51:57,233 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:57" (1/1) ... [2022-02-20 23:51:57,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:57,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:57,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:57,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:57,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:57" (1/1) ... [2022-02-20 23:51:57,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:57,270 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:57,302 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:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:57,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:57,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:57,407 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:57,408 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:57,591 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:57,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:57,596 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:51:57,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:57 BoogieIcfgContainer [2022-02-20 23:51:57,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:57,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:57,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:57,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:57,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:51:56" (1/3) ... [2022-02-20 23:51:57,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40483460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:57, skipping insertion in model container [2022-02-20 23:51:57,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:57" (2/3) ... [2022-02-20 23:51:57,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40483460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:57, skipping insertion in model container [2022-02-20 23:51:57,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:57" (3/3) ... [2022-02-20 23:51:57,604 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test21-2.i [2022-02-20 23:51:57,608 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:57,608 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:51:57,661 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:57,666 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:57,666 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:51:57,689 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:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:57,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:57,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:57,696 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:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1812086039, now seen corresponding path program 1 times [2022-02-20 23:51:57,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:57,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594628743] [2022-02-20 23:51:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:57,719 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:57,764 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:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:57,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:51:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:57,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:58,087 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:58,088 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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {26#true} is VALID [2022-02-20 23:51:58,088 INFO L272 TraceCheckUtils]: 2: Hoare triple {26#true} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {26#true} is VALID [2022-02-20 23:51:58,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} ~size := #in~size; {26#true} is VALID [2022-02-20 23:51:58,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#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; {43#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:58,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {43#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:58,092 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43#(= |ldv_malloc_#res.offset| (_ bv0 32))} {26#true} #38#return; {50#(= |ULTIMATE.start_alloc_21_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:58,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {50#(= |ULTIMATE.start_alloc_21_#t~ret38#1.offset| (_ bv0 32))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {54#(= |ULTIMATE.start_alloc_21_~p~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:58,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#(= |ULTIMATE.start_alloc_21_~p~0#1.offset| (_ bv0 32))} assume alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32;alloc_21_#res#1.base, alloc_21_#res#1.offset := alloc_21_~p~0#1.base, ~bvadd32(4bv32, alloc_21_~p~0#1.offset); {58#(= (bvadd (_ bv4294967292 32) |ULTIMATE.start_alloc_21_#res#1.offset|) (_ bv0 32))} is VALID [2022-02-20 23:51:58,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#(= (bvadd (_ bv4294967292 32) |ULTIMATE.start_alloc_21_#res#1.offset|) (_ bv0 32))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {62#(= (_ bv0 32) (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_21_~dev#1.offset|))} is VALID [2022-02-20 23:51:58,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= (_ bv0 32) (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_21_~dev#1.offset|))} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {66#(= |ULTIMATE.start_free_21_~p~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:58,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {66#(= |ULTIMATE.start_free_21_~p~1#1.offset| (_ bv0 32))} assume !(0bv32 == free_21_~p~1#1.offset); {27#false} is VALID [2022-02-20 23:51:58,097 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:58,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:58,098 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:58,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594628743] [2022-02-20 23:51:58,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594628743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:58,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:58,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:58,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297923424] [2022-02-20 23:51:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:58,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,134 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:58,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:51:58,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:51:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:58,160 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:58,467 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-02-20 23:51:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 23:51:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 23:51:58,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-02-20 23:51:58,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:58,549 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:51:58,549 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 23:51:58,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:51:58,558 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:58,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 137 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 23:51:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2022-02-20 23:51:58,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:58,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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:58,586 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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:58,587 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:58,589 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:51:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:51:58,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:58,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:58,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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 36 states. [2022-02-20 23:51:58,591 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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 36 states. [2022-02-20 23:51:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:58,597 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:51:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:51:58,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:58,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:58,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 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:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-20 23:51:58,600 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2022-02-20 23:51:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:58,601 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-20 23:51:58,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-20 23:51:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:58,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:58,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:58,611 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:58,807 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:58,808 INFO L402 AbstractCegarLoop]: === Iteration 2 === 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:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1812026457, now seen corresponding path program 1 times [2022-02-20 23:51:58,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:58,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047592093] [2022-02-20 23:51:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:58,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:58,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:58,812 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:58,815 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:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:58,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:58,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:58,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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); {215#true} is VALID [2022-02-20 23:51:58,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {215#true} is VALID [2022-02-20 23:51:58,925 INFO L272 TraceCheckUtils]: 2: Hoare triple {215#true} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {215#true} is VALID [2022-02-20 23:51:58,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {215#true} ~size := #in~size; {215#true} is VALID [2022-02-20 23:51:58,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#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; {232#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:58,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {232#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:58,927 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {232#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {215#true} #38#return; {239#(not (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:58,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(not (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32)))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {243#(not (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:58,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(not (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32)))} assume !(alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32);alloc_21_#res#1.base, alloc_21_#res#1.offset := 0bv32, 0bv32; {216#false} is VALID [2022-02-20 23:51:58,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {216#false} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {216#false} is VALID [2022-02-20 23:51:58,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {216#false} is VALID [2022-02-20 23:51:58,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !(0bv32 == free_21_~p~1#1.offset); {216#false} is VALID [2022-02-20 23:51:58,929 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:58,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:58,930 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:58,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047592093] [2022-02-20 23:51:58,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047592093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:58,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:58,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:58,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183748000] [2022-02-20 23:51:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:51:58,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:58,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:58,944 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:58,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:58,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:58,946 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,032 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-20 23:51:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:51:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 23:51:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 23:51:59,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 23:51:59,074 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:59,076 INFO L225 Difference]: With dead ends: 39 [2022-02-20 23:51:59,076 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 23:51:59,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:59,077 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:59,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 23:51:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-02-20 23:51:59,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:59,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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:59,082 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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:59,082 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,084 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-20 23:51:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-02-20 23:51:59,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:59,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:59,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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 39 states. [2022-02-20 23:51:59,086 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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 39 states. [2022-02-20 23:51:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,088 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-02-20 23:51:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-02-20 23:51:59,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:59,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:59,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:59,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-20 23:51:59,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2022-02-20 23:51:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:59,092 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-20 23:51:59,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:51:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:59,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:59,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:59,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:51:59,301 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:59,302 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:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -69216122, now seen corresponding path program 1 times [2022-02-20 23:51:59,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:59,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118859308] [2022-02-20 23:51:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:59,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:59,305 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:59,307 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:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:59,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:59,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:59,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#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); {400#true} is VALID [2022-02-20 23:51:59,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {400#true} is VALID [2022-02-20 23:51:59,454 INFO L272 TraceCheckUtils]: 2: Hoare triple {400#true} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {400#true} is VALID [2022-02-20 23:51:59,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {400#true} ~size := #in~size; {400#true} is VALID [2022-02-20 23:51:59,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {400#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {400#true} is VALID [2022-02-20 23:51:59,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#true} assume true; {400#true} is VALID [2022-02-20 23:51:59,455 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {400#true} {400#true} #38#return; {400#true} is VALID [2022-02-20 23:51:59,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#true} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {400#true} is VALID [2022-02-20 23:51:59,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#true} assume !(alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32);alloc_21_#res#1.base, alloc_21_#res#1.offset := 0bv32, 0bv32; {429#(and (= |ULTIMATE.start_alloc_21_#res#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:59,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(and (= |ULTIMATE.start_alloc_21_#res#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_#res#1.base| (_ bv0 32)))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {433#(and (= |ULTIMATE.start_free_21_~dev#1.base| (_ bv0 32)) (= |ULTIMATE.start_free_21_~dev#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:59,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(and (= |ULTIMATE.start_free_21_~dev#1.base| (_ bv0 32)) (= |ULTIMATE.start_free_21_~dev#1.offset| (_ bv0 32)))} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {401#false} is VALID [2022-02-20 23:51:59,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {401#false} assume !(0bv32 == free_21_~p~1#1.offset); {401#false} is VALID [2022-02-20 23:51:59,458 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:59,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:59,459 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:59,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118859308] [2022-02-20 23:51:59,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118859308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:59,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:59,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:59,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479132955] [2022-02-20 23:51:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:51:59,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:59,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,472 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:59,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:59,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:59,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:59,474 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,544 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:51:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:51:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-20 23:51:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-20 23:51:59,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-02-20 23:51:59,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:59,574 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:51:59,574 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:51:59,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:59,576 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 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:59,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 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:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:51:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-02-20 23:51:59,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:59,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:51:59,579 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:51:59,580 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:51:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,581 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:51:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:51:59,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:59,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:59,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 30 states. [2022-02-20 23:51:59,583 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 30 states. [2022-02-20 23:51:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:59,584 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:51:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:51:59,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:59,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:59,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:59,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:51:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 23:51:59,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2022-02-20 23:51:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:59,587 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 23:51:59,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:51:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:51:59,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:59,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:59,610 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:59,806 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:59,806 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:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -340092307, now seen corresponding path program 1 times [2022-02-20 23:51:59,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:59,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159010694] [2022-02-20 23:51:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:59,809 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:59,811 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:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:59,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:51:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:59,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:00,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {557#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); {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:00,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {562#(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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:00,063 INFO L272 TraceCheckUtils]: 2: Hoare triple {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:00,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:00,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {562#(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; {575#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:00,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {575#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:00,066 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {575#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {562#(bvult (_ bv0 32) |#StackHeapBarrier|)} #38#return; {582#(and (bvult |ULTIMATE.start_alloc_21_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:00,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#(and (bvult |ULTIMATE.start_alloc_21_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32))))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {586#(and (bvult |ULTIMATE.start_alloc_21_~p~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:00,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {586#(and (bvult |ULTIMATE.start_alloc_21_~p~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32))))} assume alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32;alloc_21_#res#1.base, alloc_21_#res#1.offset := alloc_21_~p~0#1.base, ~bvadd32(4bv32, alloc_21_~p~0#1.offset); {590#(and (bvult |ULTIMATE.start_alloc_21_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_#res#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:00,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {590#(and (bvult |ULTIMATE.start_alloc_21_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_21_#res#1.base| (_ bv0 32))))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {594#(and (not (= |ULTIMATE.start_free_21_~dev#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_free_21_~dev#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:00,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(and (not (= |ULTIMATE.start_free_21_~dev#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_free_21_~dev#1.base| |#StackHeapBarrier|))} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {598#(and (bvult |ULTIMATE.start_free_21_~p~1#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_free_21_~p~1#1.base|)))} is VALID [2022-02-20 23:52:00,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#(and (bvult |ULTIMATE.start_free_21_~p~1#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_free_21_~p~1#1.base|)))} assume 0bv32 == free_21_~p~1#1.offset; {598#(and (bvult |ULTIMATE.start_free_21_~p~1#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_free_21_~p~1#1.base|)))} is VALID [2022-02-20 23:52:00,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(and (bvult |ULTIMATE.start_free_21_~p~1#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_free_21_~p~1#1.base|)))} assume !~bvult32(free_21_~p~1#1.base, #StackHeapBarrier); {558#false} is VALID [2022-02-20 23:52:00,071 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:52:00,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:00,072 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:00,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159010694] [2022-02-20 23:52:00,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159010694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:00,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:00,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:52:00,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513571370] [2022-02-20 23:52:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:00,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:00,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,089 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:52:00,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:52:00,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:52:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:00,091 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:00,502 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:52:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:52:00,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-02-20 23:52:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-02-20 23:52:00,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-02-20 23:52:00,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:00,557 INFO L225 Difference]: With dead ends: 36 [2022-02-20 23:52:00,557 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 23:52:00,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:52:00,559 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:00,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:52:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 23:52:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-02-20 23:52:00,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:00,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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:52:00,562 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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:52:00,563 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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:52:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:00,564 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:52:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:52:00,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:00,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:00,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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 36 states. [2022-02-20 23:52:00,566 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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 36 states. [2022-02-20 23:52:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:00,567 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 23:52:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 23:52:00,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:00,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:00,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:00,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 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:52:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-20 23:52:00,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13 [2022-02-20 23:52:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:00,570 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-20 23:52:00,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:52:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 23:52:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:52:00,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:00,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:00,583 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:52:00,783 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:52:00,784 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:52:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2147420526, now seen corresponding path program 1 times [2022-02-20 23:52:00,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:00,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579346054] [2022-02-20 23:52:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:00,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:00,787 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:52:00,789 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:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:00,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:52:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:00,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:00,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {748#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); {748#true} is VALID [2022-02-20 23:52:00,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {748#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {748#true} is VALID [2022-02-20 23:52:00,913 INFO L272 TraceCheckUtils]: 2: Hoare triple {748#true} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {748#true} is VALID [2022-02-20 23:52:00,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {748#true} ~size := #in~size; {748#true} is VALID [2022-02-20 23:52:00,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {748#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {765#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:00,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {765#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {765#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:00,918 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {765#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {748#true} #38#return; {772#(and (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:00,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#(and (= |ULTIMATE.start_alloc_21_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_#t~ret38#1.offset| (_ bv0 32)))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {776#(and (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:00,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {776#(and (= |ULTIMATE.start_alloc_21_~p~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_21_~p~0#1.offset| (_ bv0 32)))} assume alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32;alloc_21_#res#1.base, alloc_21_#res#1.offset := alloc_21_~p~0#1.base, ~bvadd32(4bv32, alloc_21_~p~0#1.offset); {749#false} is VALID [2022-02-20 23:52:00,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {749#false} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {749#false} is VALID [2022-02-20 23:52:00,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {749#false} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {749#false} is VALID [2022-02-20 23:52:00,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {749#false} assume 0bv32 == free_21_~p~1#1.offset; {749#false} is VALID [2022-02-20 23:52:00,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#false} assume !~bvult32(free_21_~p~1#1.base, #StackHeapBarrier); {749#false} is VALID [2022-02-20 23:52:00,920 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:52:00,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:00,921 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:00,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579346054] [2022-02-20 23:52:00,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579346054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:00,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:00,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:00,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939574982] [2022-02-20 23:52:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:00,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:00,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:00,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:00,935 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:52:00,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:52:00,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:52:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:00,937 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,023 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:52:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:52:01,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 23:52:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 23:52:01,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-02-20 23:52:01,054 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:52:01,055 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:52:01,055 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:52:01,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:01,056 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:01,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:52:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-02-20 23:52:01,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:01,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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:52:01,060 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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:52:01,060 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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:52:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,061 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:52:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:52:01,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:01,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:01,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 29 states. [2022-02-20 23:52:01,062 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 29 states. [2022-02-20 23:52:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,064 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:52:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:52:01,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:01,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:01,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:01,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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:52:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-02-20 23:52:01,066 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 13 [2022-02-20 23:52:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:01,066 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-02-20 23:52:01,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-02-20 23:52:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:52:01,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:01,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:01,078 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:52:01,276 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:52:01,276 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:52:01,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1952926869, now seen corresponding path program 1 times [2022-02-20 23:52:01,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:01,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921052562] [2022-02-20 23:52:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:01,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:01,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:01,278 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:52:01,279 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:52:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:01,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:52:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:01,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:01,371 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:52:01,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {903#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); {903#true} is VALID [2022-02-20 23:52:01,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {903#true} is VALID [2022-02-20 23:52:01,444 INFO L272 TraceCheckUtils]: 2: Hoare triple {903#true} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {903#true} is VALID [2022-02-20 23:52:01,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {903#true} ~size := #in~size; {903#true} is VALID [2022-02-20 23:52:01,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {903#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; {920#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:01,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {920#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:01,446 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {920#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {903#true} #38#return; {927#(= (select |#valid| |ULTIMATE.start_alloc_21_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {927#(= (select |#valid| |ULTIMATE.start_alloc_21_#t~ret38#1.base|) (_ bv1 1))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {931#(= (select |#valid| |ULTIMATE.start_alloc_21_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(= (select |#valid| |ULTIMATE.start_alloc_21_~p~0#1.base|) (_ bv1 1))} assume alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32;alloc_21_#res#1.base, alloc_21_#res#1.offset := alloc_21_~p~0#1.base, ~bvadd32(4bv32, alloc_21_~p~0#1.offset); {935#(= (select |#valid| |ULTIMATE.start_alloc_21_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(= (select |#valid| |ULTIMATE.start_alloc_21_#res#1.base|) (_ bv1 1))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {939#(= (select |#valid| |ULTIMATE.start_free_21_~dev#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {939#(= (select |#valid| |ULTIMATE.start_free_21_~dev#1.base|) (_ bv1 1))} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} assume 0bv32 == free_21_~p~1#1.offset; {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} assume ~bvult32(free_21_~p~1#1.base, #StackHeapBarrier); {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:01,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {943#(= (select |#valid| |ULTIMATE.start_free_21_~p~1#1.base|) (_ bv1 1))} assume !(0bv32 == free_21_~p~1#1.base || 1bv1 == #valid[free_21_~p~1#1.base]); {904#false} is VALID [2022-02-20 23:52:01,450 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:52:01,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:01,450 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921052562] [2022-02-20 23:52:01,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921052562] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:01,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:01,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:52:01,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57484574] [2022-02-20 23:52:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:01,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,471 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:52:01,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:52:01,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:52:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:52:01,473 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,680 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:52:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:52:01,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-02-20 23:52:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-02-20 23:52:01,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-02-20 23:52:01,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:01,708 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:52:01,708 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 23:52:01,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:01,709 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:01,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:52:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 23:52:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 23:52:01,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:01,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:52:01,712 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:52:01,712 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:52:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,713 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:52:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-20 23:52:01,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:01,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:01,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 24 states. [2022-02-20 23:52:01,714 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 24 states. [2022-02-20 23:52:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:01,715 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:52:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-20 23:52:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:01,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:01,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:52:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-02-20 23:52:01,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2022-02-20 23:52:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:01,717 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-02-20 23:52:01,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:52:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-02-20 23:52:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:52:01,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:01,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:01,731 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:52:01,927 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:52:01,927 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:52:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2091935799, now seen corresponding path program 1 times [2022-02-20 23:52:01,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:01,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311352563] [2022-02-20 23:52:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:01,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:01,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:01,929 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:52:01,930 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:52:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:01,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:52:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:01,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:02,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1054#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); {1054#true} is VALID [2022-02-20 23:52:02,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,028 INFO L272 TraceCheckUtils]: 2: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {1066#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {1066#(= |old(#valid)| |#valid|)} ~size := #in~size; {1066#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {1066#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1066#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#(= |old(#valid)| |#valid|)} assume true; {1066#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,030 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1066#(= |old(#valid)| |#valid|)} {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #38#return; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32);alloc_21_#res#1.base, alloc_21_#res#1.offset := 0bv32, 0bv32; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32); {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_free_21 } true; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1062#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {1055#false} is VALID [2022-02-20 23:52:02,034 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:52:02,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:02,034 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:02,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311352563] [2022-02-20 23:52:02,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311352563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:02,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:02,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:52:02,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921807115] [2022-02-20 23:52:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:02,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,050 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:52:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:52:02,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:52:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:02,052 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,115 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:52:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:52:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-20 23:52:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-20 23:52:02,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-02-20 23:52:02,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:02,147 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:52:02,148 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:52:02,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:02,149 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:02,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:52:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:52:02,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:02,151 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:52:02,151 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:52:02,151 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:52:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,152 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:52:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:52:02,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:02,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:02,153 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:52:02,153 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:52:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,154 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:52:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:52:02,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:02,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:02,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:02,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:02,155 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:52:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-02-20 23:52:02,156 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 14 [2022-02-20 23:52:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:02,156 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-02-20 23:52:02,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:52:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 23:52:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:52:02,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:02,157 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:52:02,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:02,366 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:52:02,366 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:52:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -17303116, now seen corresponding path program 1 times [2022-02-20 23:52:02,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:02,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074658825] [2022-02-20 23:52:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:02,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:02,369 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:52:02,370 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:52:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:02,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:52:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:02,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:02,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {1180#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#true} is VALID [2022-02-20 23:52:02,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1180#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~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;assume { :begin_inline_alloc_21 } true;havoc alloc_21_#res#1.base, alloc_21_#res#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset, alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset; {1188#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:02,779 INFO L272 TraceCheckUtils]: 2: Hoare triple {1188#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset := ldv_malloc(16bv32); {1192#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {1192#(= |old(#valid)| |#valid|)} ~size := #in~size; {1192#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:02,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {1192#(= |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; {1199#(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:52:02,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {1199#(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; {1199#(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:52:02,783 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1199#(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|)))} {1188#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #38#return; {1206#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#t~ret38#1.base|))) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#t~ret38#1.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:52:02,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1206#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#t~ret38#1.base|))) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#t~ret38#1.base| v_ArrVal_13) |#valid|)))} alloc_21_~p~0#1.base, alloc_21_~p~0#1.offset := alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset;havoc alloc_21_#t~ret38#1.base, alloc_21_#t~ret38#1.offset; {1210#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_~p~0#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_~p~0#1.base|))))} is VALID [2022-02-20 23:52:02,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_~p~0#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_~p~0#1.base|))))} assume alloc_21_~p~0#1.base != 0bv32 || alloc_21_~p~0#1.offset != 0bv32;alloc_21_#res#1.base, alloc_21_#res#1.offset := alloc_21_~p~0#1.base, ~bvadd32(4bv32, alloc_21_~p~0#1.offset); {1214#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#res#1.base| v_ArrVal_13) |#valid|)) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#res#1.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:52:02,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#res#1.base| v_ArrVal_13) |#valid|)) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_alloc_21_#res#1.base|)) (_ bv0 1)))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := alloc_21_#res#1.base, alloc_21_#res#1.offset;assume { :end_inline_alloc_21 } true;entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_free_21 } true;free_21_#in~dev#1.base, free_21_#in~dev#1.offset := entry_point_~dev~0#1.base, entry_point_~dev~0#1.offset;havoc free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset, free_21_~p~1#1.base, free_21_~p~1#1.offset, free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~dev#1.base, free_21_~dev#1.offset := free_21_#in~dev#1.base, free_21_#in~dev#1.offset; {1218#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~dev#1.base| v_ArrVal_13))) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~dev#1.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:52:02,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {1218#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~dev#1.base| v_ArrVal_13))) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~dev#1.base|)) (_ bv0 1)))} assume free_21_~dev#1.base != 0bv32 || free_21_~dev#1.offset != 0bv32;free_21_~__mptr~4#1.base, free_21_~__mptr~4#1.offset := free_21_~dev#1.base, free_21_~dev#1.offset;free_21_~p~1#1.base, free_21_~p~1#1.offset := free_21_~__mptr~4#1.base, ~bvsub32(free_21_~__mptr~4#1.offset, 4bv32); {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} is VALID [2022-02-20 23:52:02,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} assume 0bv32 == free_21_~p~1#1.offset; {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} is VALID [2022-02-20 23:52:02,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} assume ~bvult32(free_21_~p~1#1.base, #StackHeapBarrier); {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} is VALID [2022-02-20 23:52:02,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {1222#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))))} assume 0bv32 == free_21_~p~1#1.base || 1bv1 == #valid[free_21_~p~1#1.base];call ULTIMATE.dealloc(free_21_~p~1#1.base, free_21_~p~1#1.offset); {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:52:02,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_free_21 } true; {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:52:02,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_entry_point } true; {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:52:02,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1232#(exists ((|ULTIMATE.start_free_21_~p~1#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_free_21_~p~1#1.base| (_ bv0 1)) |#valid|)))} assume !(#valid == main_old_#valid#1); {1181#false} is VALID [2022-02-20 23:52:02,798 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:52:02,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:02,799 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:02,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074658825] [2022-02-20 23:52:02,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074658825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:02,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:02,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:52:02,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882702262] [2022-02-20 23:52:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:02,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,819 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:52:02,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:52:02,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:52:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:02,821 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,880 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:52:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:52:02,881 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-02-20 23:52:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-02-20 23:52:02,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2022-02-20 23:52:02,904 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:52:02,905 INFO L225 Difference]: With dead ends: 17 [2022-02-20 23:52:02,905 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:52:02,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:02,906 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:02,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-02-20 23:52:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:52:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:52:02,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:02,907 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:52:02,907 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:52:02,907 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:52:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:52:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:52:02,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:02,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:02,908 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:52:02,908 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:52:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:02,908 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:52:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:52:02,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:02,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:02,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:02,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:02,909 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:52:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:52:02,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 23:52:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:02,909 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:52:02,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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:52:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:52:02,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:02,912 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2022-02-20 23:52:02,912 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:52:02,912 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:52:02,912 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2022-02-20 23:52:02,921 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:52:03,113 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:52:03,116 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:03,117 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:52:03,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:52:03 BoogieIcfgContainer [2022-02-20 23:52:03,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:52:03,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:52:03,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:52:03,120 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:52:03,121 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:57" (3/4) ... [2022-02-20 23:52:03,123 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:52:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 23:52:03,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 23:52:03,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:52:03,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:52:03,164 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:52:03,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:52:03,165 INFO L158 Benchmark]: Toolchain (without parser) took 6607.93ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 44.7MB in the beginning and 49.9MB in the end (delta: -5.2MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,166 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:52:03,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.24ms. Allocated memory is still 60.8MB. Free memory was 44.6MB in the beginning and 34.3MB in the end (delta: 10.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.56ms. Allocated memory is still 60.8MB. Free memory was 34.1MB in the beginning and 31.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,166 INFO L158 Benchmark]: Boogie Preprocessor took 49.40ms. Allocated memory is still 60.8MB. Free memory was 31.8MB in the beginning and 30.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,166 INFO L158 Benchmark]: RCFGBuilder took 357.44ms. Allocated memory is still 60.8MB. Free memory was 30.2MB in the beginning and 33.9MB in the end (delta: -3.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,167 INFO L158 Benchmark]: TraceAbstraction took 5520.74ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 33.6MB in the beginning and 52.6MB in the end (delta: -19.0MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,167 INFO L158 Benchmark]: Witness Printer took 44.39ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:52:03,168 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.24ms. Allocated memory is still 60.8MB. Free memory was 44.6MB in the beginning and 34.3MB in the end (delta: 10.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.56ms. Allocated memory is still 60.8MB. Free memory was 34.1MB in the beginning and 31.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.40ms. Allocated memory is still 60.8MB. Free memory was 31.8MB in the beginning and 30.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.44ms. Allocated memory is still 60.8MB. Free memory was 30.2MB in the beginning and 33.9MB in the end (delta: -3.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5520.74ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 33.6MB in the beginning and 52.6MB in the end (delta: -19.0MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 44.39ms. Allocated memory is still 88.1MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). 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: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 779]: 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.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 600 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 152 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, InterpolantAutomatonStates: 55, 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, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 99 ConstructedInterpolants, 12 QuantifiedInterpolants, 451 SizeOfPredicates, 31 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:52:03,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE