./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:55,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:55,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:55,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:55,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:55,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:55,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:55,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:55,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:55,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:55,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:55,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:55,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:55,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:55,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:55,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:55,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:55,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:55,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:55,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:55,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:55,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:55,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:55,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:55,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:55,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:55,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:55,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:55,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:55,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:55,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:55,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:55,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:55,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:55,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:55,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:55,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:55,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:55,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:55,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:55,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:55,700 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:49:55,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:55,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:55,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:55,741 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:55,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:55,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:55,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:55,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:55,742 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:55,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:55,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:55,744 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:55,745 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:55,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:55,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:55,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:55,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:55,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:55,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:55,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:55,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:55,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:55,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:55,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:55,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:55,747 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2022-02-20 23:49:55,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:55,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:55,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:55,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:55,963 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:55,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2022-02-20 23:49:56,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e62919cd/f6b6d16dc6a64bddadaa2eca2b70ac59/FLAG1d2b7dd9b [2022-02-20 23:49:56,435 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:56,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2022-02-20 23:49:56,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e62919cd/f6b6d16dc6a64bddadaa2eca2b70ac59/FLAG1d2b7dd9b [2022-02-20 23:49:56,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e62919cd/f6b6d16dc6a64bddadaa2eca2b70ac59 [2022-02-20 23:49:56,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:56,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:56,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:56,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:56,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:56,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:56" (1/1) ... [2022-02-20 23:49:56,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e26a1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:56, skipping insertion in model container [2022-02-20 23:49:56,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:56" (1/1) ... [2022-02-20 23:49:56,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:56,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:56,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:56,870 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:49:56,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5372e7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:56, skipping insertion in model container [2022-02-20 23:49:56,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:56,871 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:49:56,872 INFO L158 Benchmark]: Toolchain (without parser) took 403.07ms. Allocated memory is still 88.1MB. Free memory was 66.8MB in the beginning and 58.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:49:56,872 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:56,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.36ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 58.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:49:56,876 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.16ms. Allocated memory is still 88.1MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.36ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 58.7MB in the end (delta: 7.9MB). 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_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:58,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:58,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:58,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:58,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:58,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:58,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:58,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:58,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:58,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:58,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:58,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:58,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:58,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:58,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:58,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:58,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:58,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:58,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:58,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:58,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:58,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:58,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:58,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:58,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:58,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:58,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:58,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:58,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:58,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:58,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:58,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:58,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:58,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:58,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:58,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:58,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:58,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:58,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:58,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:58,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:58,859 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:49:58,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:58,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:58,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:58,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:58,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:58,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:58,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:58,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:58,901 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:58,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:58,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:58,902 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:58,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:58,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:58,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:58,903 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:58,904 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:58,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:58,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:58,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:58,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:58,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:58,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:58,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:58,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:58,905 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:58,905 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:58,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:58,906 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2022-02-20 23:49:59,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:59,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:59,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:59,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:59,297 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:59,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2022-02-20 23:49:59,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c68fc50/483768433979473c9c3977809c6e9711/FLAG1fd85d677 [2022-02-20 23:49:59,776 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:59,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2022-02-20 23:49:59,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c68fc50/483768433979473c9c3977809c6e9711/FLAG1fd85d677 [2022-02-20 23:49:59,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72c68fc50/483768433979473c9c3977809c6e9711 [2022-02-20 23:49:59,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:59,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:59,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:59,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:59,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:59,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:59" (1/1) ... [2022-02-20 23:49:59,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d35c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:59, skipping insertion in model container [2022-02-20 23:49:59,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:59" (1/1) ... [2022-02-20 23:49:59,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:59,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:00,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:00,236 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:50:00,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:00,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:00,308 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:50:00,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:00,408 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:50:00,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00 WrapperNode [2022-02-20 23:50:00,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:00,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:00,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:50:00,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:50:00,414 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:50:00" (1/1) ... [2022-02-20 23:50:00,438 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:50:00" (1/1) ... [2022-02-20 23:50:00,455 INFO L137 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 57 [2022-02-20 23:50:00,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:00,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:50:00,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:50:00,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:50:00,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:50:00,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:50:00,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:50:00,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:50:00,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (1/1) ... [2022-02-20 23:50:00,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:50:00,501 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:50:00,533 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:50:00,543 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:00,544 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-02-20 23:50:00,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-02-20 23:50:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:50:00,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:50:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2022-02-20 23:50:00,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2022-02-20 23:50:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2022-02-20 23:50:00,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2022-02-20 23:50:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:50:00,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:50:00,634 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:50:00,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:50:00,893 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:50:00,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:50:00,898 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:50:00,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:00 BoogieIcfgContainer [2022-02-20 23:50:00,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:50:00,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:50:00,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:50:00,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:50:00,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:59" (1/3) ... [2022-02-20 23:50:00,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:00, skipping insertion in model container [2022-02-20 23:50:00,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:00" (2/3) ... [2022-02-20 23:50:00,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:00, skipping insertion in model container [2022-02-20 23:50:00,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:00" (3/3) ... [2022-02-20 23:50:00,904 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2022-02-20 23:50:00,906 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:50:00,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-02-20 23:50:00,930 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:50:00,935 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:50:00,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-02-20 23:50:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:00,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:00,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:00,950 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2002543009, now seen corresponding path program 1 times [2022-02-20 23:50:00,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:00,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289904921] [2022-02-20 23:50:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:00,965 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:50:00,991 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:50:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:01,240 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:01,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:01,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,325 INFO L272 TraceCheckUtils]: 2: Hoare triple {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:01,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:01,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |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; {110#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:50:01,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} assume true; {110#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2022-02-20 23:50:01,330 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #108#return; {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,334 INFO L272 TraceCheckUtils]: 9: Hoare triple {96#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {126#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:01,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ldv_list_add_#in~head.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {130#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:01,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} assume !(1bv1 == #valid[~head.base]); {92#false} is VALID [2022-02-20 23:50:01,336 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:50:01,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:01,337 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:01,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289904921] [2022-02-20 23:50:01,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289904921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:01,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:01,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:01,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944127326] [2022-02-20 23:50:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:01,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:50:01,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:01,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:01,370 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:50:01,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:01,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:01,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:01,387 INFO L87 Difference]: Start difference. First operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:02,513 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-02-20 23:50:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:50:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-02-20 23:50:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-02-20 23:50:02,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 135 transitions. [2022-02-20 23:50:02,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:02,668 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:50:02,669 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:50:02,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:02,678 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 170 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:02,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 162 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-02-20 23:50:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:50:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2022-02-20 23:50:02,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:02,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:02,702 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:02,703 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:02,712 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2022-02-20 23:50:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2022-02-20 23:50:02,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:02,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:02,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 125 states. [2022-02-20 23:50:02,715 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 125 states. [2022-02-20 23:50:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:02,720 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2022-02-20 23:50:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2022-02-20 23:50:02,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:02,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:02,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:02,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-02-20 23:50:02,724 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 12 [2022-02-20 23:50:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:02,725 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-02-20 23:50:02,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-02-20 23:50:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:02,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:02,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:02,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:50:02,932 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:50:02,933 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2002543010, now seen corresponding path program 1 times [2022-02-20 23:50:02,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:02,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184866703] [2022-02-20 23:50:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:02,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:02,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:02,949 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:50:02,950 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:50:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:50:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:05,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:05,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {606#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {611#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {611#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,392 INFO L272 TraceCheckUtils]: 2: Hoare triple {611#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {618#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {618#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} 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; {625#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {625#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,396 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {625#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((v_ArrVal_6 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_6)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= |~#global_list_13~0.offset| (_ bv0 32)))} {611#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (_ bv0 32)))} #108#return; {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,398 INFO L272 TraceCheckUtils]: 9: Hoare triple {632#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {642#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:05,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {646#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:05,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {646#(and (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base))} assume !((~bvule32(~bvadd32(4bv32, ~head.offset), #length[~head.base]) && ~bvule32(~head.offset, ~bvadd32(4bv32, ~head.offset))) && ~bvule32(0bv32, ~head.offset)); {607#false} is VALID [2022-02-20 23:50:05,399 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:50:05,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:05,400 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:05,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184866703] [2022-02-20 23:50:05,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184866703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:05,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:05,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:05,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619937161] [2022-02-20 23:50:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:50:05,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:05,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:05,416 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:50:05,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:05,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2022-02-20 23:50:05,417 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:12,717 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:50:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:50:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2022-02-20 23:50:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2022-02-20 23:50:12,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 138 transitions. [2022-02-20 23:50:12,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:12,889 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:50:12,890 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:50:12,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=64, Invalid=142, Unknown=4, NotChecked=0, Total=210 [2022-02-20 23:50:12,891 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 251 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:12,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 139 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 97 Unchecked, 0.4s Time] [2022-02-20 23:50:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:50:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 82. [2022-02-20 23:50:12,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:12,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:12,896 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:12,901 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:12,906 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-02-20 23:50:12,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:12,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:12,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 130 states. [2022-02-20 23:50:12,915 INFO L87 Difference]: Start difference. First operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 130 states. [2022-02-20 23:50:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:12,920 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-02-20 23:50:12,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:12,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:12,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:12,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-02-20 23:50:12,926 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 12 [2022-02-20 23:50:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:12,927 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-02-20 23:50:12,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-02-20 23:50:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:12,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:12,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:12,947 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:50:13,134 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:50:13,135 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 663113707, now seen corresponding path program 1 times [2022-02-20 23:50:13,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:13,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844649412] [2022-02-20 23:50:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:13,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:13,139 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:50:13,141 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:50:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:13,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:13,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,317 INFO L272 TraceCheckUtils]: 2: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} ~size := #in~size; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} 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; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume true; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,318 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} #108#return; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:13,323 INFO L272 TraceCheckUtils]: 9: Hoare triple {1140#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {1168#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} is VALID [2022-02-20 23:50:13,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1172#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} is VALID [2022-02-20 23:50:13,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) ldv_list_add_~head.offset) ldv_list_add_~head.base)} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {1176#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,325 INFO L272 TraceCheckUtils]: 12: Hoare triple {1176#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {1180#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:13,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {1180#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {1184#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} is VALID [2022-02-20 23:50:13,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} assume !(1bv1 == #valid[~next.base]); {1136#false} is VALID [2022-02-20 23:50:13,326 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:50:13,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:13,326 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:13,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844649412] [2022-02-20 23:50:13,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844649412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:13,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:13,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:13,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741476967] [2022-02-20 23:50:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:13,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:13,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:13,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:13,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:13,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:13,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:13,340 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,429 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-02-20 23:50:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2022-02-20 23:50:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2022-02-20 23:50:14,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 119 transitions. [2022-02-20 23:50:14,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:14,552 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:50:14,552 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:50:14,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:14,553 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:14,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 350 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:50:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2022-02-20 23:50:14,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:14,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:14,558 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:14,558 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,561 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-02-20 23:50:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-02-20 23:50:14,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:14,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:14,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 115 states. [2022-02-20 23:50:14,562 INFO L87 Difference]: Start difference. First operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 115 states. [2022-02-20 23:50:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,566 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-02-20 23:50:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-02-20 23:50:14,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:14,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:14,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:14,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-02-20 23:50:14,569 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 15 [2022-02-20 23:50:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:14,569 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-02-20 23:50:14,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-02-20 23:50:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:14,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:14,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:14,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:50:14,776 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:50:14,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 663113708, now seen corresponding path program 1 times [2022-02-20 23:50:14,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:14,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510930873] [2022-02-20 23:50:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:14,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:14,779 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:50:14,779 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:50:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:14,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:50:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:14,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:17,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:17,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:17,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:17,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:17,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {1630#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {1630#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,252 INFO L272 TraceCheckUtils]: 2: Hoare triple {1630#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1637#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {1637#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {1637#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {1637#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} 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; {1644#(and (exists ((v_ArrVal_11 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_11) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {1644#(and (exists ((v_ArrVal_11 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_11) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {1644#(and (exists ((v_ArrVal_11 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_11) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,255 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1644#(and (exists ((v_ArrVal_11 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_11) |#length|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {1630#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #108#return; {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:17,257 INFO L272 TraceCheckUtils]: 9: Hoare triple {1651#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {1661#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} is VALID [2022-02-20 23:50:17,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1661#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) (_ bv0 32))) (= (_ bv2 32) |ldv_list_add_#in~head.base|) (= (_ bv0 32) |ldv_list_add_#in~head.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {1665#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:50:17,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(and (= (select (select |#memory_$Pointer$.base| ldv_list_add_~head.base) (_ bv0 32)) ldv_list_add_~head.base) (= ldv_list_add_~head.offset (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) ldv_list_add_~head.base) (= (select (select |#memory_$Pointer$.offset| ldv_list_add_~head.base) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {1669#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#t~mem14.base|))} is VALID [2022-02-20 23:50:17,262 INFO L272 TraceCheckUtils]: 12: Hoare triple {1669#(and (= |ldv_list_add_#t~mem14.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_add_#t~mem14.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {1673#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)) (= (_ bv2 32) |__ldv_list_add_#in~next.base|))} is VALID [2022-02-20 23:50:17,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1673#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__ldv_list_add_#in~next.offset| (_ bv0 32)) (= (_ bv2 32) |__ldv_list_add_#in~next.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {1677#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv2 32) __ldv_list_add_~next.base))} is VALID [2022-02-20 23:50:17,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= __ldv_list_add_~next.offset (_ bv0 32)) (= (_ bv2 32) __ldv_list_add_~next.base))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)), #length[~next.base]) && ~bvule32(~bvadd32(4bv32, ~next.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~next.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~next.offset))); {1626#false} is VALID [2022-02-20 23:50:17,263 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:50:17,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:17,263 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:17,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510930873] [2022-02-20 23:50:17,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510930873] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:17,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:17,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:17,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905519937] [2022-02-20 23:50:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:17,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:17,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:17,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:17,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:17,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:50:17,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:17,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:50:17,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:17,282 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,478 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-02-20 23:50:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:50:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 23:50:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-02-20 23:50:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-02-20 23:50:23,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 126 transitions. [2022-02-20 23:50:23,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:23,626 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:50:23,626 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:50:23,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=95, Invalid=322, Unknown=3, NotChecked=0, Total=420 [2022-02-20 23:50:23,627 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 124 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:23,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 317 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 381 Invalid, 0 Unknown, 64 Unchecked, 0.7s Time] [2022-02-20 23:50:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:50:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2022-02-20 23:50:23,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:23,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:23,631 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:23,631 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,633 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-02-20 23:50:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-02-20 23:50:23,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 118 states. [2022-02-20 23:50:23,634 INFO L87 Difference]: Start difference. First operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 118 states. [2022-02-20 23:50:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,639 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-02-20 23:50:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-02-20 23:50:23,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:23,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 23:50:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-02-20 23:50:23,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 15 [2022-02-20 23:50:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:23,650 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-02-20 23:50:23,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-02-20 23:50:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:23,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:23,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:23,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:50:23,857 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:50:23,857 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1949585109, now seen corresponding path program 1 times [2022-02-20 23:50:23,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:23,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751579711] [2022-02-20 23:50:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:23,859 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:50:23,860 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:50:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:23,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {2134#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {2134#true} is VALID [2022-02-20 23:50:23,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2134#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {2134#true} is VALID [2022-02-20 23:50:23,942 INFO L272 TraceCheckUtils]: 2: Hoare triple {2134#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {2134#true} is VALID [2022-02-20 23:50:23,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {2134#true} ~size := #in~size; {2134#true} is VALID [2022-02-20 23:50:23,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2134#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; {2151#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:23,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2151#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2151#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:23,944 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2151#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {2134#true} #108#return; {2158#(not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:23,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {2158#(not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {2162#(not (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:23,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(not (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {2135#false} is VALID [2022-02-20 23:50:23,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#false} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {2135#false} is VALID [2022-02-20 23:50:23,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#false} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {2135#false} is VALID [2022-02-20 23:50:23,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {2135#false} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {2135#false} is VALID [2022-02-20 23:50:23,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {2135#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)), #length[free_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset))); {2135#false} is VALID [2022-02-20 23:50:23,945 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:50:23,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:23,946 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:23,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751579711] [2022-02-20 23:50:23,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751579711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:23,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:23,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:23,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41465965] [2022-02-20 23:50:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:23,947 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:50:23,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:23,947 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:50:23,959 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:50:23,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:23,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:23,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:23,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:23,960 INFO L87 Difference]: Start difference. First operand 80 states and 82 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:50:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,371 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-02-20 23:50:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:24,371 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:50:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:24,371 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:50:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-02-20 23:50:24,372 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:50:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-02-20 23:50:24,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 116 transitions. [2022-02-20 23:50:24,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:24,459 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:50:24,459 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:50:24,459 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:50:24,460 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 24 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 401 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:50:24,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 401 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:50:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2022-02-20 23:50:24,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:24,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,471 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,472 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,475 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-02-20 23:50:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-02-20 23:50:24,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:24,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:24,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 110 states. [2022-02-20 23:50:24,484 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 110 states. [2022-02-20 23:50:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:24,487 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-02-20 23:50:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-02-20 23:50:24,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:24,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:24,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:24,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-02-20 23:50:24,490 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2022-02-20 23:50:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:24,490 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-02-20 23:50:24,490 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:50:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-02-20 23:50:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:24,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:24,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:24,511 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:50:24,697 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:50:24,698 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash 142130646, now seen corresponding path program 1 times [2022-02-20 23:50:24,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:24,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687141037] [2022-02-20 23:50:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:24,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:24,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:24,700 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:50:24,701 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:50:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:24,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:50:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:24,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:24,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:24,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:25,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {2591#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,044 INFO L272 TraceCheckUtils]: 2: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,047 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2603#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #108#return; {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:25,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {2596#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {2628#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ULTIMATE.start_free_13_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:25,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {2628#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |ULTIMATE.start_free_13_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {2632#(and (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:25,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {2632#(and (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)), #length[free_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset))); {2592#false} is VALID [2022-02-20 23:50:25,050 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:50:25,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:25,051 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:25,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687141037] [2022-02-20 23:50:25,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687141037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:25,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:25,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:25,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308534121] [2022-02-20 23:50:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:25,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:25,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:25,077 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:50:25,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:25,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:25,078 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,176 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-02-20 23:50:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:26,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:50:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:50:26,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-02-20 23:50:26,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:26,293 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:50:26,293 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:50:26,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:26,293 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:26,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 243 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:50:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-02-20 23:50:26,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:26,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,298 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,298 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,301 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-02-20 23:50:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-02-20 23:50:26,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 109 states. [2022-02-20 23:50:26,303 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 109 states. [2022-02-20 23:50:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,305 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-02-20 23:50:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-02-20 23:50:26,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:26,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-02-20 23:50:26,307 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 13 [2022-02-20 23:50:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:26,308 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-02-20 23:50:26,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-02-20 23:50:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:26,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:26,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:26,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:50:26,508 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:50:26,509 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:26,509 INFO L85 PathProgramCache]: Analyzing trace with hash 142130645, now seen corresponding path program 1 times [2022-02-20 23:50:26,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:26,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904139085] [2022-02-20 23:50:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:26,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:26,511 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:50:26,511 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:50:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:26,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:26,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {3058#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,751 INFO L272 TraceCheckUtils]: 2: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,753 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3070#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #108#return; {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:26,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {3063#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {3095#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:26,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {3095#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {3099#(and (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:26,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {3099#(and (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(1bv1 == #valid[free_13_~p~1#1.base]); {3059#false} is VALID [2022-02-20 23:50:26,757 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:50:26,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:26,757 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:26,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904139085] [2022-02-20 23:50:26,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904139085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:26,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:26,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:26,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683977509] [2022-02-20 23:50:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:26,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:26,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:26,772 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:50:26,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:26,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:26,773 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:27,614 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-20 23:50:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:27,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:50:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:50:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:50:27,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-02-20 23:50:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:27,706 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:50:27,706 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:50:27,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:27,707 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:27,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 190 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:50:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2022-02-20 23:50:27,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:27,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:27,710 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:27,710 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:27,712 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-20 23:50:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-20 23:50:27,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:27,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:27,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 104 states. [2022-02-20 23:50:27,714 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 104 states. [2022-02-20 23:50:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:27,716 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-02-20 23:50:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-02-20 23:50:27,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:27,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:27,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:27,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2022-02-20 23:50:27,719 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 13 [2022-02-20 23:50:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:27,720 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2022-02-20 23:50:27,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2022-02-20 23:50:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:27,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:27,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:27,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:50:27,926 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:50:27,927 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -918311498, now seen corresponding path program 1 times [2022-02-20 23:50:27,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:27,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652829890] [2022-02-20 23:50:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:27,929 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:50:27,930 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:50:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:27,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:27,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:27,999 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:50:28,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {3510#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {3510#true} is VALID [2022-02-20 23:50:28,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {3510#true} is VALID [2022-02-20 23:50:28,063 INFO L272 TraceCheckUtils]: 2: Hoare triple {3510#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3510#true} is VALID [2022-02-20 23:50:28,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {3510#true} ~size := #in~size; {3510#true} is VALID [2022-02-20 23:50:28,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {3510#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; {3527#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:28,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {3527#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {3527#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:28,064 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3527#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {3510#true} #108#return; {3534#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {3534#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {3538#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {3538#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {3538#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,066 INFO L272 TraceCheckUtils]: 9: Hoare triple {3538#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {3545#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:28,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {3545#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {3549#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:28,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {3549#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {3549#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:28,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {3549#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {3556#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:28,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {3556#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {3560#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:28,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {3560#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {3560#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:28,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {3560#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} assume !(1bv1 == #valid[~new.base]); {3511#false} is VALID [2022-02-20 23:50:28,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:50:28,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:28,071 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:28,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652829890] [2022-02-20 23:50:28,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652829890] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:28,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:28,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:50:28,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332639213] [2022-02-20 23:50:28,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:28,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:28,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:28,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:28,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:28,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:28,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:28,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:28,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:28,086 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,376 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-02-20 23:50:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:29,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-02-20 23:50:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-02-20 23:50:29,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 128 transitions. [2022-02-20 23:50:29,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:29,503 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:50:29,503 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:50:29,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:29,504 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 47 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:29,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 419 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:50:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2022-02-20 23:50:29,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:29,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,507 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,508 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,510 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-02-20 23:50:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-02-20 23:50:29,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 127 states. [2022-02-20 23:50:29,516 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 127 states. [2022-02-20 23:50:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,518 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-02-20 23:50:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-02-20 23:50:29,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:29,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-02-20 23:50:29,521 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 16 [2022-02-20 23:50:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:29,521 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-02-20 23:50:29,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:50:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:29,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:29,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:29,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:50:29,728 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:50:29,728 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash -918311497, now seen corresponding path program 1 times [2022-02-20 23:50:29,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:29,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690874938] [2022-02-20 23:50:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:29,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:29,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:29,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:50:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:29,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:29,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:29,853 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:50:30,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {4054#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {4054#true} is VALID [2022-02-20 23:50:30,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {4054#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {4054#true} is VALID [2022-02-20 23:50:30,025 INFO L272 TraceCheckUtils]: 2: Hoare triple {4054#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4054#true} is VALID [2022-02-20 23:50:30,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {4054#true} ~size := #in~size; {4068#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:30,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {4068#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {4072#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {4072#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {4072#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,028 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4072#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {4054#true} #108#return; {4079#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:30,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {4079#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {4083#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:30,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {4083#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {4083#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:30,031 INFO L272 TraceCheckUtils]: 9: Hoare triple {4083#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {4090#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:30,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {4090#(and (= (select |#length| |ldv_list_add_#in~new.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4094#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:30,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {4094#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4094#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:30,044 INFO L272 TraceCheckUtils]: 12: Hoare triple {4094#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4101#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} is VALID [2022-02-20 23:50:30,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {4101#(and (= (select |#length| |__ldv_list_add_#in~new.base|) (_ bv12 32)) (= |__ldv_list_add_#in~new.offset| (_ bv4 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {4105#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:30,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {4105#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4105#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:30,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4105#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~new.offset), #length[~new.base]) && ~bvule32(~new.offset, ~bvadd32(4bv32, ~new.offset))) && ~bvule32(0bv32, ~new.offset)); {4055#false} is VALID [2022-02-20 23:50:30,049 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:50:30,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:30,049 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:30,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690874938] [2022-02-20 23:50:30,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690874938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:30,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:30,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:30,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902382411] [2022-02-20 23:50:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:30,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:30,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:30,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:30,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:30,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:30,069 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,856 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-02-20 23:50:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-02-20 23:50:31,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2022-02-20 23:50:31,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:31,986 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:50:31,986 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:50:31,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:31,986 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:31,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 505 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:50:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:50:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2022-02-20 23:50:31,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:31,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,994 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,995 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,997 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-02-20 23:50:31,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 130 states. [2022-02-20 23:50:31,998 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Second operand 130 states. [2022-02-20 23:50:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,000 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-02-20 23:50:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-02-20 23:50:32,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:32,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-02-20 23:50:32,001 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2022-02-20 23:50:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:32,002 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-02-20 23:50:32,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:50:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:32,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:32,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:32,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:32,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,203 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:32,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash -789228779, now seen corresponding path program 1 times [2022-02-20 23:50:32,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:32,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205820964] [2022-02-20 23:50:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:32,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:32,206 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:32,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:50:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:32,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {4610#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {4610#true} is VALID [2022-02-20 23:50:32,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {4610#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {4610#true} is VALID [2022-02-20 23:50:32,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {4610#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4610#true} is VALID [2022-02-20 23:50:32,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {4610#true} ~size := #in~size; {4610#true} is VALID [2022-02-20 23:50:32,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {4610#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4627#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {4627#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {4627#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4627#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {4610#true} #108#return; {4634#(and (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {4634#(and (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {4638#(and (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:32,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4638#(and (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {4611#false} is VALID [2022-02-20 23:50:32,388 INFO L272 TraceCheckUtils]: 9: Hoare triple {4611#false} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {4611#false} is VALID [2022-02-20 23:50:32,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {4611#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4611#false} is VALID [2022-02-20 23:50:32,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {4611#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4611#false} is VALID [2022-02-20 23:50:32,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {4611#false} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4611#false} is VALID [2022-02-20 23:50:32,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {4611#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {4611#false} is VALID [2022-02-20 23:50:32,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {4611#false} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4611#false} is VALID [2022-02-20 23:50:32,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {4611#false} assume !(1bv1 == #valid[~new.base]); {4611#false} is VALID [2022-02-20 23:50:32,389 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:50:32,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:32,390 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:32,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205820964] [2022-02-20 23:50:32,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205820964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:32,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:32,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:32,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141924824] [2022-02-20 23:50:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:32,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:32,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:32,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:32,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:32,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:32,411 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,767 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-02-20 23:50:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:50:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-02-20 23:50:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-02-20 23:50:32,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2022-02-20 23:50:32,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:32,848 INFO L225 Difference]: With dead ends: 91 [2022-02-20 23:50:32,848 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:50:32,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:50:32,849 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 310 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:50:32,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 310 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:50:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-02-20 23:50:32,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:32,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,851 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,851 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,853 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-02-20 23:50:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-02-20 23:50:32,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 91 states. [2022-02-20 23:50:32,854 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 91 states. [2022-02-20 23:50:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,855 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-02-20 23:50:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-02-20 23:50:32,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:32,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:32,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:32,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-02-20 23:50:32,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 16 [2022-02-20 23:50:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:32,857 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-02-20 23:50:32,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-02-20 23:50:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:32,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:32,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:32,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:33,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,064 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2029051719, now seen corresponding path program 1 times [2022-02-20 23:50:33,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:33,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571543814] [2022-02-20 23:50:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:33,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:33,066 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:33,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:50:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {5021#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {5021#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L272 TraceCheckUtils]: 2: Hoare triple {5021#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {5021#true} ~size := #in~size; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {5021#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; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {5021#true} assume true; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5021#true} {5021#true} #108#return; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {5021#true} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {5021#true} is VALID [2022-02-20 23:50:33,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {5021#true} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {5021#true} is VALID [2022-02-20 23:50:33,225 INFO L272 TraceCheckUtils]: 9: Hoare triple {5021#true} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {5021#true} is VALID [2022-02-20 23:50:33,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {5021#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5021#true} is VALID [2022-02-20 23:50:33,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {5021#true} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {5059#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:33,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {5059#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {5063#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:33,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {5063#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {5067#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} assume !(1bv1 == #valid[~prev.base]); {5022#false} is VALID [2022-02-20 23:50:33,228 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:50:33,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:33,228 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:33,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571543814] [2022-02-20 23:50:33,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571543814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:33,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:33,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:33,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604985845] [2022-02-20 23:50:33,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:33,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:33,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:33,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:33,244 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,665 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-02-20 23:50:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-02-20 23:50:33,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-02-20 23:50:33,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,725 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:50:33,725 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:50:33,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:33,726 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:33,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 197 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:50:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-02-20 23:50:33,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:33,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,742 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,742 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,743 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-20 23:50:33,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 85 states. [2022-02-20 23:50:33,744 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 85 states. [2022-02-20 23:50:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,745 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-20 23:50:33,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:33,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-02-20 23:50:33,747 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 18 [2022-02-20 23:50:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:33,747 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-02-20 23:50:33,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-20 23:50:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:33,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:33,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:33,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:33,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,955 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2029051718, now seen corresponding path program 1 times [2022-02-20 23:50:33,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:33,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082698309] [2022-02-20 23:50:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:33,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:33,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:33,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:50:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:34,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:34,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:34,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {5421#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,181 INFO L272 TraceCheckUtils]: 2: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} ~size := #in~size; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} 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; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} assume true; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,183 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} #108#return; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:34,184 INFO L272 TraceCheckUtils]: 9: Hoare triple {5426#(= |~#global_list_13~0.offset| (_ bv0 32))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {5454#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} is VALID [2022-02-20 23:50:34,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {5454#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {5458#(= ldv_list_add_~head.offset (_ bv0 32))} is VALID [2022-02-20 23:50:34,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {5458#(= ldv_list_add_~head.offset (_ bv0 32))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {5462#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} is VALID [2022-02-20 23:50:34,185 INFO L272 TraceCheckUtils]: 12: Hoare triple {5462#(and (= ldv_list_add_~head.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {5466#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} is VALID [2022-02-20 23:50:34,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {5466#(and (= |__ldv_list_add_#in~prev.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |__ldv_list_add_#in~prev.offset|) (select |#length| |__ldv_list_add_#in~prev.base|)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:34,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:34,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:34,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} is VALID [2022-02-20 23:50:34,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {5470#(and (= __ldv_list_add_~prev.offset (_ bv0 32)) (bvule (bvadd (_ bv4 32) __ldv_list_add_~prev.offset) (select |#length| __ldv_list_add_~prev.base)))} assume !((~bvule32(~bvadd32(4bv32, ~prev.offset), #length[~prev.base]) && ~bvule32(~prev.offset, ~bvadd32(4bv32, ~prev.offset))) && ~bvule32(0bv32, ~prev.offset)); {5422#false} is VALID [2022-02-20 23:50:34,192 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:50:34,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:34,193 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:34,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082698309] [2022-02-20 23:50:34,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082698309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:34,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:34,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:34,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243955223] [2022-02-20 23:50:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:34,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:34,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:34,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:34,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:34,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:34,210 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,007 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-02-20 23:50:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:35,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:50:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 23:50:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-02-20 23:50:35,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 77 transitions. [2022-02-20 23:50:35,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:35,067 INFO L225 Difference]: With dead ends: 84 [2022-02-20 23:50:35,067 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 23:50:35,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:35,068 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 79 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:35,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 318 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 23:50:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-02-20 23:50:35,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:35,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:35,070 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:35,071 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,072 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-02-20 23:50:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-02-20 23:50:35,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:35,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:35,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 84 states. [2022-02-20 23:50:35,073 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 84 states. [2022-02-20 23:50:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:35,075 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-02-20 23:50:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-02-20 23:50:35,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:35,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:35,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:35,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2022-02-20 23:50:35,078 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 18 [2022-02-20 23:50:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:35,078 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2022-02-20 23:50:35,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-02-20 23:50:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:50:35,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:35,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:35,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:35,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:35,286 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -781083149, now seen corresponding path program 1 times [2022-02-20 23:50:35,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:35,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659050912] [2022-02-20 23:50:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:35,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:35,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:50:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:35,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {5828#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,507 INFO L272 TraceCheckUtils]: 2: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:35,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:35,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:35,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume true; {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:35,509 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5840#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #108#return; {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_free_13 } true; {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,518 INFO L272 TraceCheckUtils]: 16: Hoare triple {5833#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {5883#(and (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {5883#(and (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {5887#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:35,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {5887#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~list.base]); {5829#false} is VALID [2022-02-20 23:50:35,519 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:50:35,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:35,519 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:35,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659050912] [2022-02-20 23:50:35,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659050912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:35,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:35,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:35,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30623295] [2022-02-20 23:50:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:35,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 23:50:35,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:35,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:35,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:35,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:35,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:35,538 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:36,295 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-02-20 23:50:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 23:50:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-02-20 23:50:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2022-02-20 23:50:36,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2022-02-20 23:50:36,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:36,407 INFO L225 Difference]: With dead ends: 121 [2022-02-20 23:50:36,407 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 23:50:36,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:36,407 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 94 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:36,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 139 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 23:50:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2022-02-20 23:50:36,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:36,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:36,410 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:36,410 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:36,411 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-02-20 23:50:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-02-20 23:50:36,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:36,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:36,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 121 states. [2022-02-20 23:50:36,412 INFO L87 Difference]: Start difference. First operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 121 states. [2022-02-20 23:50:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:36,414 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-02-20 23:50:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-02-20 23:50:36,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:36,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:36,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:36,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:50:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-02-20 23:50:36,419 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 19 [2022-02-20 23:50:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:36,419 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-02-20 23:50:36,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-02-20 23:50:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:50:36,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:36,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:36,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 23:50:36,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:36,627 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -781083148, now seen corresponding path program 1 times [2022-02-20 23:50:36,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:36,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973383090] [2022-02-20 23:50:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:36,629 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:36,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:50:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:36,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:36,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:36,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {6351#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,936 INFO L272 TraceCheckUtils]: 2: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,941 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6363#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} #108#return; {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_free_13 } true; {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,945 INFO L272 TraceCheckUtils]: 16: Hoare triple {6356#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {6406#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:50:36,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {6406#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (_ bv0 32) |LDV_INIT_LIST_HEAD_#in~list.offset|))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {6410#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} is VALID [2022-02-20 23:50:36,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {6410#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= LDV_INIT_LIST_HEAD_~list.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {6352#false} is VALID [2022-02-20 23:50:36,947 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:50:36,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:36,947 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:36,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973383090] [2022-02-20 23:50:36,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973383090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:36,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:36,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:36,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362469403] [2022-02-20 23:50:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:36,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 23:50:36,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:36,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:36,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:36,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:36,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:36,966 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,675 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-02-20 23:50:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 23:50:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-02-20 23:50:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-02-20 23:50:37,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2022-02-20 23:50:37,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:37,765 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:50:37,765 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:50:37,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:37,767 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:37,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 238 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:50:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-02-20 23:50:37,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:37,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:37,770 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:37,770 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,773 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-02-20 23:50:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-02-20 23:50:37,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Second operand 102 states. [2022-02-20 23:50:37,773 INFO L87 Difference]: Start difference. First operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Second operand 102 states. [2022-02-20 23:50:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,775 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-02-20 23:50:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-02-20 23:50:37,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:37,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 23:50:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2022-02-20 23:50:37,777 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 19 [2022-02-20 23:50:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:37,777 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2022-02-20 23:50:37,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:50:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-02-20 23:50:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:50:37,777 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:37,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:37,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:37,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,985 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash -151348929, now seen corresponding path program 1 times [2022-02-20 23:50:37,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:37,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140992536] [2022-02-20 23:50:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:37,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:37,987 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:37,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:50:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:38,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {6824#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {6824#true} is VALID [2022-02-20 23:50:38,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {6824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,112 INFO L272 TraceCheckUtils]: 2: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {6836#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:38,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {6836#(= |old(#valid)| |#valid|)} ~size := #in~size; {6836#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:38,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {6836#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {6836#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:38,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {6836#(= |old(#valid)| |#valid|)} assume true; {6836#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:38,114 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6836#(= |old(#valid)| |#valid|)} {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #108#return; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_free_13 } true; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,117 INFO L272 TraceCheckUtils]: 16: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {6824#true} is VALID [2022-02-20 23:50:38,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {6824#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {6824#true} is VALID [2022-02-20 23:50:38,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {6824#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {6824#true} is VALID [2022-02-20 23:50:38,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {6824#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {6824#true} is VALID [2022-02-20 23:50:38,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {6824#true} assume true; {6824#true} is VALID [2022-02-20 23:50:38,119 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6824#true} {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #114#return; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:38,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {6832#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {6825#false} is VALID [2022-02-20 23:50:38,120 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:50:38,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:38,121 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:38,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140992536] [2022-02-20 23:50:38,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140992536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:38,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:38,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:50:38,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120489466] [2022-02-20 23:50:38,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:50:38,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:38,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:38,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:38,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:50:38,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:38,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:50:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:50:38,141 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,478 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-02-20 23:50:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:50:38,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 23:50:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-02-20 23:50:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-02-20 23:50:38,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-02-20 23:50:38,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:38,562 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:50:38,562 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:50:38,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:50:38,562 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:38,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 101 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:50:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-02-20 23:50:38,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:38,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:38,565 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:38,565 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,566 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-02-20 23:50:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:50:38,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 82 states. [2022-02-20 23:50:38,567 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 82 states. [2022-02-20 23:50:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,568 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-02-20 23:50:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:50:38,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:38,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-02-20 23:50:38,570 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 24 [2022-02-20 23:50:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:38,570 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-02-20 23:50:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:50:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:38,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:38,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:38,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:38,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,777 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 345895671, now seen corresponding path program 1 times [2022-02-20 23:50:38,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:38,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402035080] [2022-02-20 23:50:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:38,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:38,780 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:38,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:50:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:50:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:38,907 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:50:39,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:39,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:39,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:39,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:50:39,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {7246#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {7246#true} is VALID [2022-02-20 23:50:39,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {7246#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {7246#true} is VALID [2022-02-20 23:50:39,360 INFO L272 TraceCheckUtils]: 2: Hoare triple {7246#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {7246#true} is VALID [2022-02-20 23:50:39,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {7246#true} ~size := #in~size; {7260#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:39,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {7260#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {7264#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:39,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {7264#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {7264#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:39,367 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7264#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {7246#true} #108#return; {7271#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:39,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {7271#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {7275#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:39,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {7275#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {7275#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:39,373 INFO L272 TraceCheckUtils]: 9: Hoare triple {7275#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {7282#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} is VALID [2022-02-20 23:50:39,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {7282#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {7286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:39,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {7286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {7286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:39,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {7286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {7282#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} is VALID [2022-02-20 23:50:39,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {7282#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:39,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:39,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:39,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:39,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {7296#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {7309#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:39,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {7309#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {7309#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:39,399 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7309#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {7286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:39,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:39,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:39,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7316#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_3|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {7275#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {7326#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:50:39,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {7326#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {7326#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:50:39,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {7326#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {7333#(and (= (select |#length| |ULTIMATE.start_free_13_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))} is VALID [2022-02-20 23:50:39,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {7333#(and (= (select |#length| |ULTIMATE.start_free_13_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {7337#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:39,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {7337#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)), #length[free_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_13_~p~1#1.offset))); {7247#false} is VALID [2022-02-20 23:50:39,403 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:50:39,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:39,403 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:39,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402035080] [2022-02-20 23:50:39,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402035080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:39,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:39,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:50:39,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290128713] [2022-02-20 23:50:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:39,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:39,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:39,446 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:50:39,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:50:39,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:39,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:50:39,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:39,447 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:39,912 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-02-20 23:50:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:50:39,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2022-02-20 23:50:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2022-02-20 23:50:39,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2022-02-20 23:50:39,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:39,987 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:50:39,987 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:50:39,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:50:39,988 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:39,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 241 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-02-20 23:50:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:50:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-02-20 23:50:39,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:39,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:39,990 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:39,990 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:39,991 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-02-20 23:50:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-02-20 23:50:39,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:39,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:39,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 82 states. [2022-02-20 23:50:39,991 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 82 states. [2022-02-20 23:50:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:39,992 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-02-20 23:50:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-02-20 23:50:39,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:39,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:39,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:39,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 69 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-02-20 23:50:39,994 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2022-02-20 23:50:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:39,994 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-02-20 23:50:39,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-02-20 23:50:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:39,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:39,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:40,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:40,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:40,206 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash 345895670, now seen corresponding path program 1 times [2022-02-20 23:50:40,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:40,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334822747] [2022-02-20 23:50:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:40,209 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:40,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:50:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:50:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:40,308 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:50:40,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:40,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-02-20 23:50:40,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {7671#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {7671#true} is VALID [2022-02-20 23:50:40,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {7671#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {7671#true} is VALID [2022-02-20 23:50:40,633 INFO L272 TraceCheckUtils]: 2: Hoare triple {7671#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {7671#true} is VALID [2022-02-20 23:50:40,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {7671#true} ~size := #in~size; {7671#true} is VALID [2022-02-20 23:50:40,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {7671#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; {7688#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:40,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {7688#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {7688#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:40,635 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7688#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {7671#true} #108#return; {7695#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:40,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {7695#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {7699#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:40,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {7699#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {7699#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:40,636 INFO L272 TraceCheckUtils]: 9: Hoare triple {7699#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {7706#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {7706#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {7710#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {7710#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {7710#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {7710#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {7706#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {7706#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:40,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:40,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:40,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:40,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {7720#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {7733#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {7733#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} assume true; {7733#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,644 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7733#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} {7710#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} #106#return; {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} havoc #t~mem14.base, #t~mem14.offset; {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} assume true; {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} is VALID [2022-02-20 23:50:40,645 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7740#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_4|) (_ bv1 1))))} {7699#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} #110#return; {7750#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:40,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {7750#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {7750#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:40,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {7750#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {7757#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:40,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {7757#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {7761#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {7761#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[free_13_~p~1#1.base]); {7672#false} is VALID [2022-02-20 23:50:40,647 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:50:40,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:40,647 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:40,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334822747] [2022-02-20 23:50:40,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334822747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:40,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:40,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:50:40,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792854839] [2022-02-20 23:50:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:40,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:40,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:40,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:40,675 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:50:40,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:50:40,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:50:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:40,676 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,921 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:50:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:50:40,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-02-20 23:50:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-02-20 23:50:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 80 transitions. [2022-02-20 23:50:40,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 80 transitions. [2022-02-20 23:50:40,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:40,988 INFO L225 Difference]: With dead ends: 81 [2022-02-20 23:50:40,988 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 23:50:40,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:40,989 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:40,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-02-20 23:50:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 23:50:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-02-20 23:50:40,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:40,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:40,991 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:40,991 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,992 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:50:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:50:40,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-02-20 23:50:40,992 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 81 states. [2022-02-20 23:50:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,993 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:50:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:50:40,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:40,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.42) internal successors, (71), 68 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-02-20 23:50:40,994 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 27 [2022-02-20 23:50:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:40,995 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-02-20 23:50:40,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-02-20 23:50:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:40,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:40,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:41,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,196 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash -566103308, now seen corresponding path program 1 times [2022-02-20 23:50:41,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:41,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592265496] [2022-02-20 23:50:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:41,207 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:41,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:50:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:50:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:41,324 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:50:41,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:41,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-02-20 23:50:41,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {8089#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {8089#true} is VALID [2022-02-20 23:50:41,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {8089#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {8089#true} is VALID [2022-02-20 23:50:41,715 INFO L272 TraceCheckUtils]: 2: Hoare triple {8089#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {8089#true} is VALID [2022-02-20 23:50:41,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {8089#true} ~size := #in~size; {8089#true} is VALID [2022-02-20 23:50:41,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {8089#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; {8106#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:41,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {8106#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {8106#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:41,717 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8106#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {8089#true} #108#return; {8113#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:41,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {8113#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {8117#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:41,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {8117#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {8117#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:41,719 INFO L272 TraceCheckUtils]: 9: Hoare triple {8117#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {8124#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {8124#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {8128#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {8128#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {8128#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,721 INFO L272 TraceCheckUtils]: 12: Hoare triple {8128#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {8124#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {8124#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:41,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:41,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:41,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:41,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {8138#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {8151#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {8151#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} assume true; {8151#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,727 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8151#(and (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} {8128#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} #106#return; {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} havoc #t~mem14.base, #t~mem14.offset; {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} assume true; {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} is VALID [2022-02-20 23:50:41,728 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8158#(and (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_5|) (_ bv1 1))))} {8117#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} #110#return; {8168#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:41,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {8168#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {8168#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:41,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {8168#(= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) (_ bv1 1)) (_ bv0 1))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {8175#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:50:41,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {8175#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_#t~mem39#1.base|)) (_ bv1 1)) (_ bv0 1))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,732 INFO L272 TraceCheckUtils]: 29: Hoare triple {8179#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_13_~p~1#1.base|)) (_ bv1 1)))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {8192#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_#in~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {8192#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_#in~entry#1.base|)) (_ bv1 1)))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {8196#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:41,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {8196#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[~entry#1.base]); {8090#false} is VALID [2022-02-20 23:50:41,733 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:50:41,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:41,733 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:41,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592265496] [2022-02-20 23:50:41,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592265496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:41,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:41,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:50:41,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935399906] [2022-02-20 23:50:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:41,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:41,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:41,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:50:41,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:50:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:41,769 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,451 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-02-20 23:50:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:50:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 109 transitions. [2022-02-20 23:50:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 109 transitions. [2022-02-20 23:50:43,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 109 transitions. [2022-02-20 23:50:43,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:43,563 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:50:43,563 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:50:43,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:50:43,564 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:43,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 374 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 332 Invalid, 0 Unknown, 211 Unchecked, 0.5s Time] [2022-02-20 23:50:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:50:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2022-02-20 23:50:43,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:43,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:43,566 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:43,566 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,567 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-02-20 23:50:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-02-20 23:50:43,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 105 states. [2022-02-20 23:50:43,569 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 105 states. [2022-02-20 23:50:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,570 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-02-20 23:50:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-02-20 23:50:43,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:43,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 78 states have internal predecessors, (89), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-02-20 23:50:43,572 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 32 [2022-02-20 23:50:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:43,572 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-02-20 23:50:43,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:50:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:43,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:43,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:43,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-02-20 23:50:43,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:43,782 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash -566103307, now seen corresponding path program 1 times [2022-02-20 23:50:43,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:43,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817506564] [2022-02-20 23:50:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:43,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:43,784 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:43,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:50:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-20 23:50:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:43,923 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:50:44,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:44,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:44,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:44,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:50:44,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {8626#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {8626#true} is VALID [2022-02-20 23:50:44,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {8626#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {8626#true} is VALID [2022-02-20 23:50:44,461 INFO L272 TraceCheckUtils]: 2: Hoare triple {8626#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {8626#true} is VALID [2022-02-20 23:50:44,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {8626#true} ~size := #in~size; {8640#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:44,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {8640#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {8644#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:44,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {8644#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {8644#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:44,463 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8644#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {8626#true} #108#return; {8651#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:44,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {8651#(and (= (select |#length| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv12 32)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {8655#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:44,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {8655#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:44,465 INFO L272 TraceCheckUtils]: 9: Hoare triple {8655#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {8662#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {8662#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {8666#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {8666#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {8666#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,467 INFO L272 TraceCheckUtils]: 12: Hoare triple {8666#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {8662#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {8662#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:44,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:44,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:44,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:44,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {8676#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {8689#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:44,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {8689#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {8689#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:44,477 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8689#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {8666#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:44,478 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8696#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_6|) (_ bv12 32))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {8655#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {8706#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {8706#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {8706#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {8706#(and (= (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv12 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {8713#(and (= (select |#length| |ULTIMATE.start_free_13_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))} is VALID [2022-02-20 23:50:44,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {8713#(and (= (select |#length| |ULTIMATE.start_free_13_#t~mem39#1.base|) (_ bv12 32)) (= (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:44,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:44,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:44,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:44,481 INFO L272 TraceCheckUtils]: 29: Hoare triple {8717#(and (= (select |#length| |ULTIMATE.start_free_13_~p~1#1.base|) (_ bv12 32)) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {8730#(and (= (_ bv12 32) (select |#length| |ldv_list_del_#in~entry#1.base|)) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} is VALID [2022-02-20 23:50:44,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {8730#(and (= (_ bv12 32) (select |#length| |ldv_list_del_#in~entry#1.base|)) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {8734#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:50:44,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {8734#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~entry#1.offset)), #length[~entry#1.base]) && ~bvule32(~bvadd32(4bv32, ~entry#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~entry#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~entry#1.offset))); {8627#false} is VALID [2022-02-20 23:50:44,483 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:50:44,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:44,483 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:44,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817506564] [2022-02-20 23:50:44,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817506564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:44,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:44,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:50:44,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136343086] [2022-02-20 23:50:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:44,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:44,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:44,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:44,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:50:44,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:50:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:50:44,519 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,891 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-02-20 23:50:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:50:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-02-20 23:50:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 95 transitions. [2022-02-20 23:50:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 95 transitions. [2022-02-20 23:50:45,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 95 transitions. [2022-02-20 23:50:45,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,983 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:50:45,983 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:50:45,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:50:46,000 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:46,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 388 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 165 Unchecked, 0.4s Time] [2022-02-20 23:50:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:50:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-02-20 23:50:46,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:46,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:46,002 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:46,002 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,010 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-02-20 23:50:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 23:50:46,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 97 states. [2022-02-20 23:50:46,011 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 97 states. [2022-02-20 23:50:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,012 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-02-20 23:50:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 23:50:46,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:46,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 78 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:50:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-02-20 23:50:46,015 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2022-02-20 23:50:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:46,015 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-02-20 23:50:46,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-20 23:50:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:50:46,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:46,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:46,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:46,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,224 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -372722091, now seen corresponding path program 1 times [2022-02-20 23:50:46,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:46,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711533892] [2022-02-20 23:50:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:46,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:46,226 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:50:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,397 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:46,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:50:46,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:46,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-20 23:50:46,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {9132#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {9137#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:46,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {9137#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {9137#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:46,750 INFO L272 TraceCheckUtils]: 2: Hoare triple {9137#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {9144#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:46,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {9144#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {9144#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:46,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {9144#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |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; {9151#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} is VALID [2022-02-20 23:50:46,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {9151#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} assume true; {9151#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} is VALID [2022-02-20 23:50:46,752 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9151#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} {9137#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #108#return; {9158#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} is VALID [2022-02-20 23:50:46,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {9158#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {9162#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:46,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {9162#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {9162#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:46,753 INFO L272 TraceCheckUtils]: 9: Hoare triple {9162#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {9169#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:46,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {9169#(= (_ bv2 32) |~#global_list_13~0.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {9173#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {9173#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {9173#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,755 INFO L272 TraceCheckUtils]: 12: Hoare triple {9173#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {9169#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:46,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {9169#(= (_ bv2 32) |~#global_list_13~0.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {9183#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {9196#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:46,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {9196#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {9196#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:50:46,761 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9196#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {9173#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|))} #106#return; {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} havoc #t~mem14.base, #t~mem14.offset; {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} assume true; {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:46,762 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9203#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|))} {9162#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} #110#return; {9213#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:46,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {9213#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {9213#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:46,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {9213#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {9220#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|)))} is VALID [2022-02-20 23:50:46,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {9220#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_#t~mem39#1.base|)))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} is VALID [2022-02-20 23:50:46,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} is VALID [2022-02-20 23:50:46,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} is VALID [2022-02-20 23:50:46,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {9224#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_13_~p~1#1.base|)))} assume !(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {9133#false} is VALID [2022-02-20 23:50:46,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {9133#false} assume { :end_inline_free_13 } true; {9133#false} is VALID [2022-02-20 23:50:46,765 INFO L272 TraceCheckUtils]: 30: Hoare triple {9133#false} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {9133#false} is VALID [2022-02-20 23:50:46,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {9133#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {9133#false} is VALID [2022-02-20 23:50:46,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {9133#false} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {9133#false} is VALID [2022-02-20 23:50:46,765 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:50:46,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:46,766 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:46,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711533892] [2022-02-20 23:50:46,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711533892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:46,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:46,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:50:46,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922844784] [2022-02-20 23:50:46,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-02-20 23:50:46,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:46,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:46,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:46,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:50:46,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:50:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:46,801 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,421 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-02-20 23:50:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:50:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-02-20 23:50:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 130 transitions. [2022-02-20 23:50:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 130 transitions. [2022-02-20 23:50:49,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 130 transitions. [2022-02-20 23:50:49,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:49,575 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:50:49,575 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:50:49,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:50:49,575 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 282 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:49,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 147 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 23:50:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:50:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 85. [2022-02-20 23:50:49,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:49,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:49,577 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:49,577 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,581 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-02-20 23:50:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-02-20 23:50:49,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 132 states. [2022-02-20 23:50:49,581 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 132 states. [2022-02-20 23:50:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:49,583 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-02-20 23:50:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-02-20 23:50:49,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:49,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:49,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:49,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 72 states have internal predecessors, (79), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-02-20 23:50:49,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 33 [2022-02-20 23:50:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:49,586 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-02-20 23:50:49,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-02-20 23:50:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:50:49,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:49,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:49,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:49,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:49,794 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1552970525, now seen corresponding path program 1 times [2022-02-20 23:50:49,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:49,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273797091] [2022-02-20 23:50:49,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:49,798 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:49,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:50:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 23:50:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:50,058 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:50,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 23:50:50,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:50:50,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:50,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:50,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:50:50,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:50,552 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:50:50,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:50:50,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-02-20 23:50:50,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-02-20 23:50:51,306 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:50:51,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-02-20 23:50:51,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {9752#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {9757#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {9757#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {9757#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,367 INFO L272 TraceCheckUtils]: 2: Hoare triple {9757#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {9764#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {9764#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {9764#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {9764#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} 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; {9771#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {9771#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {9771#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:51,369 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9771#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {9757#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #108#return; {9778#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} is VALID [2022-02-20 23:50:51,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {9778#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {9782#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:51,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {9782#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {9782#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:51,371 INFO L272 TraceCheckUtils]: 9: Hoare triple {9782#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {9789#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:50:51,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {9789#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {9793#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:51,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {9793#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {9797#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:51,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {9797#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {9801#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {9805#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:51,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {9805#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {9805#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:51,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {9805#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {9812#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:51,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {9812#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {9812#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:51,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {9812#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {9819#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:50:51,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {9819#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} assume true; {9819#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:50:51,383 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9819#(and (= (_ bv2 32) |~#global_list_13~0.base|) (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_6| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_6|) (_ bv1 1))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} {9797#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:51,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:51,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:51,386 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9826#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {9782#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {9836#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:50:51,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {9836#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {9836#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:50:51,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {9836#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {9843#(and (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_#t~mem39#1.base|) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv2 32)))))} is VALID [2022-02-20 23:50:51,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {9843#(and (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_#t~mem39#1.base|) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv2 32)))))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} is VALID [2022-02-20 23:50:51,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} is VALID [2022-02-20 23:50:51,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} is VALID [2022-02-20 23:50:51,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} is VALID [2022-02-20 23:50:51,394 INFO L272 TraceCheckUtils]: 29: Hoare triple {9847#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)) (_ bv2 32)))))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {9860#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} is VALID [2022-02-20 23:50:51,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {9860#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {9864#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:50:51,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {9864#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} SUMMARY for call #t~mem16#1.base, #t~mem16#1.offset := read~$Pointer$(~entry#1.base, ~bvadd32(4bv32, ~entry#1.offset), 4bv32); srcloc: L567 {9864#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} is VALID [2022-02-20 23:50:51,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {9864#(and (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv4 32))) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} SUMMARY for call #t~mem17#1.base, #t~mem17#1.offset := read~$Pointer$(~entry#1.base, ~entry#1.offset, 4bv32); srcloc: L567-1 {9871#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem17#1.base|))} is VALID [2022-02-20 23:50:51,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {9871#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem17#1.base|))} assume { :begin_inline___ldv_list_del } true;__ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset, __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset := #t~mem16#1.base, #t~mem16#1.offset, #t~mem17#1.base, #t~mem17#1.offset;havoc __ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset;__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset := __ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset;__ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset := __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset; {9875#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~next#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} is VALID [2022-02-20 23:50:51,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {9875#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~next#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} assume !(1bv1 == #valid[__ldv_list_del_~next#1.base]); {9753#false} is VALID [2022-02-20 23:50:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:51,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:51,399 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:51,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273797091] [2022-02-20 23:50:51,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273797091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:51,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:51,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-20 23:50:51,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053095219] [2022-02-20 23:50:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:50:51,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:51,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:51,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:51,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:50:51,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:50:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:50:51,449 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,500 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-02-20 23:50:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:50:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:50:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 86 transitions. [2022-02-20 23:50:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 86 transitions. [2022-02-20 23:50:53,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 86 transitions. [2022-02-20 23:50:53,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:53,599 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:50:53,599 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:50:53,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:50:53,600 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:53,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 537 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 290 Unchecked, 0.5s Time] [2022-02-20 23:50:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:50:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-02-20 23:50:53,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:53,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:53,601 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:53,601 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,602 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-02-20 23:50:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-02-20 23:50:53,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 88 states. [2022-02-20 23:50:53,603 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 88 states. [2022-02-20 23:50:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,604 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-02-20 23:50:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-02-20 23:50:53,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:53,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:50:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-02-20 23:50:53,606 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 35 [2022-02-20 23:50:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:53,606 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-02-20 23:50:53,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-02-20 23:50:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:50:53,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:53,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:53,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:53,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,807 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:50:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1552970526, now seen corresponding path program 1 times [2022-02-20 23:50:53,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:53,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141069433] [2022-02-20 23:50:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:53,832 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:53,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:50:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-20 23:50:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:54,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 23:50:54,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:50:54,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:50:54,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:54,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:50:54,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:54,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:50:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:54,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:50:54,867 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:50:54,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:50:54,931 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:50:54,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-02-20 23:50:55,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2022-02-20 23:50:55,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-20 23:50:55,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:50:55,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-02-20 23:50:55,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2022-02-20 23:50:56,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {10245#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {10250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {10250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {10250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {10250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {10257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {10257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} ~size := #in~size; {10257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {10257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} 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; {10264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {10264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} assume true; {10264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,035 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} {10250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|))} #108#return; {10271#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} is VALID [2022-02-20 23:50:56,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {10271#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {10275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:56,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {10275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {10275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:50:56,040 INFO L272 TraceCheckUtils]: 9: Hoare triple {10275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {10282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:50:56,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {10282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {10286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:56,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {10286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {10290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| ldv_list_add_~head.base) ldv_list_add_~head.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:56,042 INFO L272 TraceCheckUtils]: 12: Hoare triple {10290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| ldv_list_add_~head.base) ldv_list_add_~head.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {10294#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {10294#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {10298#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {10298#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {10302#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (bvule (bvadd (_ bv8 32) __ldv_list_add_~next.offset) (select |#length| __ldv_list_add_~next.base)) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {10302#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= __ldv_list_add_~next.offset |__ldv_list_add_#in~next.offset|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~next.base| __ldv_list_add_~next.base) (bvule (bvadd (_ bv8 32) __ldv_list_add_~next.offset) (select |#length| __ldv_list_add_~next.base)) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {10306#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) __ldv_list_add_~new.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {10306#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) __ldv_list_add_~new.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {10306#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) __ldv_list_add_~new.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {10306#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= |__ldv_list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) __ldv_list_add_~new.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) __ldv_list_add_~new.offset) |__ldv_list_add_#in~next.base|) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {10313#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|)) (= (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|) |__ldv_list_add_#in~next.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:50:56,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {10313#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|)) (= (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|) |__ldv_list_add_#in~next.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} assume true; {10313#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|)) (= (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|) |__ldv_list_add_#in~next.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} is VALID [2022-02-20 23:50:56,053 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10313#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv8 32) |__ldv_list_add_#in~next.offset|) (select |#length| |__ldv_list_add_#in~next.base|)) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|)) (= (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|) |__ldv_list_add_#in~next.offset|)) (or (= |__ldv_list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) |__ldv_list_add_#in~new.offset|)) (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~new.offset| |__ldv_list_add_#in~prev.offset|))))} {10290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= |ldv_list_add_#t~mem14.offset| (select (select |old(#memory_$Pointer$.offset)| ldv_list_add_~head.base) ldv_list_add_~head.offset)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |old(#memory_$Pointer$.base)| ldv_list_add_~head.base) ldv_list_add_~head.offset) |ldv_list_add_#t~mem14.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:56,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:56,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:50:56,057 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10320#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (bvule (bvadd (_ bv8 32) (select (select |old(#memory_$Pointer$.offset)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (= (select (select |old(#memory_$Pointer$.base)| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| |ldv_list_add_#in~new.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {10275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {10330#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:50:56,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {10330#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {10330#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:50:56,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {10330#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) |~#global_list_13~0.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {10337#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:56,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {10337#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.base|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,062 INFO L272 TraceCheckUtils]: 29: Hoare triple {10341#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {10354#(and (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_#in~entry#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 23:50:56,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {10354#(and (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_#in~entry#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {10358#(and (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)))} is VALID [2022-02-20 23:50:56,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {10358#(and (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)))} SUMMARY for call #t~mem16#1.base, #t~mem16#1.offset := read~$Pointer$(~entry#1.base, ~bvadd32(4bv32, ~entry#1.offset), 4bv32); srcloc: L567 {10358#(and (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)))} is VALID [2022-02-20 23:50:56,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {10358#(and (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv2 32)) (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)))} SUMMARY for call #t~mem17#1.base, #t~mem17#1.offset := read~$Pointer$(~entry#1.base, ~entry#1.offset, 4bv32); srcloc: L567-1 {10365#(and (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 32) |ldv_list_del_#t~mem17#1.offset|) (= (_ bv2 32) |ldv_list_del_#t~mem17#1.base|))} is VALID [2022-02-20 23:50:56,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {10365#(and (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 32) |ldv_list_del_#t~mem17#1.offset|) (= (_ bv2 32) |ldv_list_del_#t~mem17#1.base|))} assume { :begin_inline___ldv_list_del } true;__ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset, __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset := #t~mem16#1.base, #t~mem16#1.offset, #t~mem17#1.base, #t~mem17#1.offset;havoc __ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset;__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset := __ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset;__ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset := __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset; {10369#(and (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~next#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del___ldv_list_del_~next#1.base|))} is VALID [2022-02-20 23:50:56,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {10369#(and (bvule (_ bv8 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~next#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del___ldv_list_del_~next#1.base|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, __ldv_list_del_~next#1.offset)), #length[__ldv_list_del_~next#1.base]) && ~bvule32(~bvadd32(4bv32, __ldv_list_del_~next#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, __ldv_list_del_~next#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, __ldv_list_del_~next#1.offset))); {10246#false} is VALID [2022-02-20 23:50:56,065 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:50:56,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:56,065 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:56,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141069433] [2022-02-20 23:50:56,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141069433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:56,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:56,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 23:50:56,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820582627] [2022-02-20 23:50:56,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:56,066 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:50:56,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:56,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:50:56,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:56,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 23:50:56,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 23:50:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:50:56,119 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:01,955 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-02-20 23:51:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 23:51:01,956 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 23:51:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-02-20 23:51:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2022-02-20 23:51:01,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 85 transitions. [2022-02-20 23:51:02,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:02,073 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:51:02,073 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:51:02,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2022-02-20 23:51:02,074 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 117 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:02,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 549 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 23:51:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:51:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-20 23:51:02,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:02,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:02,076 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:02,076 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:02,077 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-02-20 23:51:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-02-20 23:51:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:02,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 87 states. [2022-02-20 23:51:02,078 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 87 states. [2022-02-20 23:51:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:02,079 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-02-20 23:51:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-02-20 23:51:02,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:02,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:02,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:02,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-02-20 23:51:02,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2022-02-20 23:51:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:02,082 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-02-20 23:51:02,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 23:51:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:51:02,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:02,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:02,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:02,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:02,283 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:51:02,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 897446074, now seen corresponding path program 1 times [2022-02-20 23:51:02,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:02,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744884589] [2022-02-20 23:51:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:02,286 INFO L229 MonitoredProcess]: Starting monitored process 24 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:02,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-02-20 23:51:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:02,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:51:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:02,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:02,539 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:02,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 23:51:02,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:51:02,926 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 23:51:02,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:51:02,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:51:03,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-02-20 23:51:03,554 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:51:03,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-02-20 23:51:03,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {10756#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {10761#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} is VALID [2022-02-20 23:51:03,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {10761#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {10761#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} is VALID [2022-02-20 23:51:03,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {10761#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {10768#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:51:03,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {10768#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {10768#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:51:03,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {10768#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |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; {10775#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:03,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {10775#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {10775#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:03,612 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10775#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {10761#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} #108#return; {10782#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} is VALID [2022-02-20 23:51:03,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {10782#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {10786#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:03,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {10786#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {10786#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:03,614 INFO L272 TraceCheckUtils]: 9: Hoare triple {10786#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {10793#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:51:03,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {10793#(= (_ bv2 32) |~#global_list_13~0.base|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {10797#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:03,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {10797#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {10801#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:03,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {10801#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {10805#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:51:03,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {10805#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:03,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:03,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:03,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {10809#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {10819#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset)) __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:03,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {10819#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset)) __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {10823#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:03,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {10823#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {10823#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:03,622 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10823#(and (exists ((v_ldv_list_add_~head.base_BEFORE_CALL_10 (_ BitVec 32))) (= (_ bv1 1) (select |#valid| v_ldv_list_add_~head.base_BEFORE_CALL_10))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {10801#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv1 1) (select |#valid| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:03,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:03,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:03,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10830#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~new.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_list_add_#in~head.base|))) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {10786#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {10840#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {10840#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {10840#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:03,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#(and (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |~#global_list_13~0.base|))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {10847#(and (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_#t~mem39#1.base|) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))))} is VALID [2022-02-20 23:51:03,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {10847#(and (= (bvadd (_ bv4294967292 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_#t~mem39#1.base|) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_#t~mem39#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} is VALID [2022-02-20 23:51:03,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} is VALID [2022-02-20 23:51:03,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} is VALID [2022-02-20 23:51:03,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} is VALID [2022-02-20 23:51:03,630 INFO L272 TraceCheckUtils]: 29: Hoare triple {10851#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= |ULTIMATE.start_free_13_~p~1#1.offset| (_ bv0 32)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv8 32) |ULTIMATE.start_free_13_~p~1#1.offset|))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|) |ULTIMATE.start_free_13_~p~1#1.base|))))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {10864#(and (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))))} is VALID [2022-02-20 23:51:03,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {10864#(and (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {10868#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv8 32))))))} is VALID [2022-02-20 23:51:03,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {10868#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv8 32))))))} SUMMARY for call #t~mem16#1.base, #t~mem16#1.offset := read~$Pointer$(~entry#1.base, ~bvadd32(4bv32, ~entry#1.offset), 4bv32); srcloc: L567 {10872#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:03,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {10872#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} SUMMARY for call #t~mem17#1.base, #t~mem17#1.offset := read~$Pointer$(~entry#1.base, ~entry#1.offset, 4bv32); srcloc: L567-1 {10872#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:03,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {10872#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} assume { :begin_inline___ldv_list_del } true;__ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset, __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset := #t~mem16#1.base, #t~mem16#1.offset, #t~mem17#1.base, #t~mem17#1.offset;havoc __ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset;__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset := __ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset;__ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset := __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset; {10879#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} is VALID [2022-02-20 23:51:03,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {10879#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} SUMMARY for call write~$Pointer$(__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, ~bvadd32(4bv32, __ldv_list_del_~next#1.offset), 4bv32); srcloc: L554 {10879#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} is VALID [2022-02-20 23:51:03,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {10879#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))))} assume !(1bv1 == #valid[__ldv_list_del_~prev#1.base]); {10757#false} is VALID [2022-02-20 23:51:03,634 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:03,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:03,634 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:03,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744884589] [2022-02-20 23:51:03,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744884589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:03,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:03,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-20 23:51:03,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251014070] [2022-02-20 23:51:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:03,635 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-02-20 23:51:03,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:03,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:03,683 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:51:03,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:51:03,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:51:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:51:03,684 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:04,929 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-02-20 23:51:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:51:04,929 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-02-20 23:51:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-02-20 23:51:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-02-20 23:51:04,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 84 transitions. [2022-02-20 23:51:05,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:05,028 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:51:05,028 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:51:05,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:51:05,029 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:05,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 427 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 208 Unchecked, 0.3s Time] [2022-02-20 23:51:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:51:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-02-20 23:51:05,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:05,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:05,031 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:05,031 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:05,032 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-02-20 23:51:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-02-20 23:51:05,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:05,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:05,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 86 states. [2022-02-20 23:51:05,033 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 86 states. [2022-02-20 23:51:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:05,034 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-02-20 23:51:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-02-20 23:51:05,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:05,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:05,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:05,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:51:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-02-20 23:51:05,036 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 36 [2022-02-20 23:51:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:05,036 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-02-20 23:51:05,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-02-20 23:51:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:51:05,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:05,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:05,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:05,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:05,245 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:51:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 897446075, now seen corresponding path program 1 times [2022-02-20 23:51:05,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:05,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144670522] [2022-02-20 23:51:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:05,247 INFO L229 MonitoredProcess]: Starting monitored process 25 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:05,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-02-20 23:51:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:05,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-20 23:51:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:05,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:05,500 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:05,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 23:51:05,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:51:05,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:51:05,921 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-02-20 23:51:05,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2022-02-20 23:51:05,940 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 23:51:05,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:51:06,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 43 [2022-02-20 23:51:06,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:06,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-02-20 23:51:06,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {11245#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);~#global_list_13~0.base, ~#global_list_13~0.offset := 2bv32, 0bv32;call #Ultimate.allocInit(8bv32, 2bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32);call write~init~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, ~#global_list_13~0.base, ~bvadd32(4bv32, ~#global_list_13~0.offset), 4bv32); {11250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {11250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;assume { :begin_inline_alloc_13 } true;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset, alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset; {11250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,908 INFO L272 TraceCheckUtils]: 2: Hoare triple {11250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {11257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {11257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {11257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {11257#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |~#global_list_13~0.offset| (_ bv0 32)))} 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; {11264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {11264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {11264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,910 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11264#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {11250#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} #108#return; {11271#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= |~#global_list_13~0.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} is VALID [2022-02-20 23:51:06,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {11271#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |ULTIMATE.start_alloc_13_#t~ret38#1.offset| (_ bv0 32)) (= |~#global_list_13~0.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv2 32))))} alloc_13_~p~0#1.base, alloc_13_~p~0#1.offset := alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset;havoc alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset; {11275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:06,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {11275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {11275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:06,912 INFO L272 TraceCheckUtils]: 9: Hoare triple {11275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} call ldv_list_add(alloc_13_~p~0#1.base, ~bvadd32(4bv32, alloc_13_~p~0#1.offset), ~#global_list_13~0.base, ~#global_list_13~0.offset); {11282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {11282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {11286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {11286#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {11290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,914 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {11282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {11282#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset; {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4bv32); srcloc: L547-1 {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {11297#(and (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~bvadd32(4bv32, ~new.offset), 4bv32); srcloc: L548 {11307#(and (= __ldv_list_add_~prev.offset (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset))) (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset)) __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:51:06,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {11307#(and (= __ldv_list_add_~prev.offset (select (select |#memory_$Pointer$.offset| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset))) (= |__ldv_list_add_#in~prev.base| __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~prev.offset| __ldv_list_add_~prev.offset) (= (_ bv2 32) |~#global_list_13~0.base|) (= (select (select |#memory_$Pointer$.base| __ldv_list_add_~new.base) (bvadd (_ bv4 32) __ldv_list_add_~new.offset)) __ldv_list_add_~prev.base) (= |__ldv_list_add_#in~new.offset| __ldv_list_add_~new.offset) (= |~#global_list_13~0.offset| (_ bv0 32)) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4bv32); srcloc: L549 {11311#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~prev.offset| (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~prev.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32))))) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:06,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {11311#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~prev.offset| (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~prev.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32))))) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} assume true; {11311#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~prev.offset| (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~prev.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32))))) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} is VALID [2022-02-20 23:51:06,932 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {11311#(and (= (_ bv2 32) |~#global_list_13~0.base|) (or (and (= |__ldv_list_add_#in~prev.base| |__ldv_list_add_#in~new.base|) (= |__ldv_list_add_#in~prev.offset| (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~prev.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32))))) (= |__ldv_list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~new.base|) (bvadd |__ldv_list_add_#in~new.offset| (_ bv4 32)))) (= |__ldv_list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)) (= |~#global_list_13~0.offset| (_ bv0 32)) (= |__ldv_list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__ldv_list_add_#in~prev.base|) |__ldv_list_add_#in~prev.offset|)))} {11290#(and (= ldv_list_add_~head.offset |ldv_list_add_#in~head.offset|) (= |ldv_list_add_#in~head.base| ldv_list_add_~head.base) (bvule (bvadd (_ bv4 32) ldv_list_add_~head.offset) (select |#length| ldv_list_add_~head.base)) (= (_ bv2 32) |~#global_list_13~0.base|) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #106#return; {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} havoc #t~mem14.base, #t~mem14.offset; {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} assume true; {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} is VALID [2022-02-20 23:51:06,950 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11318#(and (= (_ bv2 32) |~#global_list_13~0.base|) (bvule (bvadd (_ bv4 32) |ldv_list_add_#in~head.offset|) (select |#length| |ldv_list_add_#in~head.base|)) (= |ldv_list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.base|) (or (and (= (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) |ldv_list_add_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|))) |ldv_list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |ldv_list_add_#in~head.base|) |ldv_list_add_#in~head.offset|) |ldv_list_add_#in~new.offset|))} {11275#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #110#return; {11328#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:06,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {11328#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_13 } true;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset, free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset, free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset, free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset, free_13_#t~mem41#1.base, free_13_#t~mem41#1.offset, free_13_~__mptr~6#1.base, free_13_~__mptr~6#1.offset, free_13_~p~1#1.base, free_13_~p~1#1.offset, free_13_~n~1#1.base, free_13_~n~1#1.offset;havoc free_13_~p~1#1.base, free_13_~p~1#1.offset;havoc free_13_~n~1#1.base, free_13_~n~1#1.offset; {11328#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:51:06,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {11328#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) (_ bv2 32))) (bvule (bvadd (_ bv4 32) |~#global_list_13~0.offset|) (select |#length| |~#global_list_13~0.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|))) |~#global_list_13~0.base|) (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| |~#global_list_13~0.base|) |~#global_list_13~0.offset|)) (_ bv0 32)))} SUMMARY for call free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {11335#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:51:06,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {11335#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.offset|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_#t~mem39#1.base|))} free_13_~__mptr~4#1.base, free_13_~__mptr~4#1.offset := free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;havoc free_13_#t~mem39#1.base, free_13_#t~mem39#1.offset;free_13_~p~1#1.base, free_13_~p~1#1.offset := free_13_~__mptr~4#1.base, ~bvsub32(free_13_~__mptr~4#1.offset, 4bv32); {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} SUMMARY for call free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset := read~$Pointer$(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} free_13_~__mptr~5#1.base, free_13_~__mptr~5#1.offset := free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;havoc free_13_#t~mem40#1.base, free_13_#t~mem40#1.offset;free_13_~n~1#1.base, free_13_~n~1#1.offset := free_13_~__mptr~5#1.base, ~bvsub32(free_13_~__mptr~5#1.offset, 4bv32); {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} assume !!(free_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_13_~p~1#1.offset) != ~#global_list_13~0.offset); {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:51:06,955 INFO L272 TraceCheckUtils]: 29: Hoare triple {11339#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)) |ULTIMATE.start_free_13_~p~1#1.base|) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) (bvadd (_ bv4 32) |ULTIMATE.start_free_13_~p~1#1.offset|)))} call ldv_list_del(free_13_~p~1#1.base, ~bvadd32(4bv32, free_13_~p~1#1.offset)); {11352#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= |ldv_list_del_#in~entry#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 23:51:06,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {11352#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= |ldv_list_del_#in~entry#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {11356#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} is VALID [2022-02-20 23:51:06,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {11356#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)) |ldv_list_del_~entry#1.offset|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) (_ bv0 32)) (= |ldv_list_del_~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} SUMMARY for call #t~mem16#1.base, #t~mem16#1.offset := read~$Pointer$(~entry#1.base, ~bvadd32(4bv32, ~entry#1.offset), 4bv32); srcloc: L567 {11360#(and (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:06,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {11360#(and (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} SUMMARY for call #t~mem17#1.base, #t~mem17#1.offset := read~$Pointer$(~entry#1.base, ~entry#1.offset, 4bv32); srcloc: L567-1 {11360#(and (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:06,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {11360#(and (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} assume { :begin_inline___ldv_list_del } true;__ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset, __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset := #t~mem16#1.base, #t~mem16#1.offset, #t~mem17#1.base, #t~mem17#1.offset;havoc __ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset;__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset := __ldv_list_del_#in~prev#1.base, __ldv_list_del_#in~prev#1.offset;__ldv_list_del_~next#1.base, __ldv_list_del_~next#1.offset := __ldv_list_del_#in~next#1.base, __ldv_list_del_#in~next#1.offset; {11367#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {11367#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(__ldv_list_del_~prev#1.base, __ldv_list_del_~prev#1.offset, __ldv_list_del_~next#1.base, ~bvadd32(4bv32, __ldv_list_del_~next#1.offset), 4bv32); srcloc: L554 {11367#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:06,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {11367#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (bvule (_ bv4 32) (select |#length| (_ bv2 32))) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, __ldv_list_del_~prev#1.offset), #length[__ldv_list_del_~prev#1.base]) && ~bvule32(__ldv_list_del_~prev#1.offset, ~bvadd32(4bv32, __ldv_list_del_~prev#1.offset))) && ~bvule32(0bv32, __ldv_list_del_~prev#1.offset)); {11246#false} is VALID [2022-02-20 23:51:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:06,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:06,959 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:06,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144670522] [2022-02-20 23:51:06,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144670522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:06,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:06,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 23:51:06,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355803563] [2022-02-20 23:51:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:06,960 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-02-20 23:51:06,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:06,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:51:07,109 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:51:07,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 23:51:07,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 23:51:07,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:51:07,110 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)