./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:02,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:02,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:02,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:02,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:02,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:02,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:02,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:02,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:02,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:02,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:02,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:02,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:02,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:02,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:02,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:02,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:02,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:02,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:02,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:02,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:02,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:02,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:02,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:02,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:02,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:02,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:02,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:02,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:02,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:02,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:02,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:02,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:02,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:02,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:02,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:02,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:02,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:02,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:02,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:02,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:02,987 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:50:03,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:03,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:03,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:03,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:03,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:03,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:03,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:03,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:03,013 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:03,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:03,014 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:03,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:03,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:03,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:03,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:03,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:03,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:03,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:03,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:50:03,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:50:03,018 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2022-02-20 23:50:03,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:03,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:03,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:03,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:03,211 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:03,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2022-02-20 23:50:03,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a3ae0f9/21abfcf8619f4fbc9b66131050b8a6c6/FLAG2f302f8d3 [2022-02-20 23:50:03,649 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:03,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2022-02-20 23:50:03,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a3ae0f9/21abfcf8619f4fbc9b66131050b8a6c6/FLAG2f302f8d3 [2022-02-20 23:50:04,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a3ae0f9/21abfcf8619f4fbc9b66131050b8a6c6 [2022-02-20 23:50:04,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:04,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:04,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:04,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:04,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:04,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:04" (1/1) ... [2022-02-20 23:50:04,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707336a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:04, skipping insertion in model container [2022-02-20 23:50:04,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:04" (1/1) ... [2022-02-20 23:50:04,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:04,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:04,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:04,414 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:50:04,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@317cdb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:04, skipping insertion in model container [2022-02-20 23:50:04,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:04,415 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:50:04,416 INFO L158 Benchmark]: Toolchain (without parser) took 357.60ms. Allocated memory is still 102.8MB. Free memory was 66.8MB in the beginning and 71.5MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:50:04,417 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 73.4MB in the beginning and 73.4MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:50:04,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.44ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 71.5MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:50:04,418 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.14ms. Allocated memory is still 102.8MB. Free memory was 73.4MB in the beginning and 73.4MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.44ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 71.5MB in the end (delta: -4.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_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:50:05,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:50:05,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:50:05,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:50:05,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:50:05,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:50:05,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:50:05,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:50:05,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:50:05,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:50:05,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:50:05,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:50:05,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:50:05,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:50:05,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:50:05,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:50:05,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:50:05,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:50:05,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:50:05,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:50:05,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:50:05,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:50:05,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:50:05,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:50:05,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:50:05,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:50:05,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:50:05,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:50:05,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:50:05,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:50:05,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:50:05,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:50:05,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:50:05,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:50:05,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:50:05,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:50:05,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:50:05,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:50:05,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:50:05,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:50:05,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:50:05,945 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:50:05,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:50:05,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:50:05,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:50:05,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:50:05,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:50:05,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:50:05,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:50:05,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:50:05,961 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:50:05,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:50:05,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:50:05,961 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:50:05,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:50:05,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:50:05,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:05,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:05,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:50:05,964 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2022-02-20 23:50:06,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:50:06,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:50:06,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:50:06,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:50:06,230 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:50:06,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2022-02-20 23:50:06,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf0c6171/58c29ae9673e48c0b9416a9f874a90bf/FLAG91b4dada6 [2022-02-20 23:50:06,696 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:50:06,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2022-02-20 23:50:06,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf0c6171/58c29ae9673e48c0b9416a9f874a90bf/FLAG91b4dada6 [2022-02-20 23:50:07,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf0c6171/58c29ae9673e48c0b9416a9f874a90bf [2022-02-20 23:50:07,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:50:07,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:50:07,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:07,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:50:07,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:50:07,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:07" (1/1) ... [2022-02-20 23:50:07,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bef7e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:07, skipping insertion in model container [2022-02-20 23:50:07,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:50:07" (1/1) ... [2022-02-20 23:50:07,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:50:07,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:07,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:07,558 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:50:07,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:50:07,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:07,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:50:07,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:50:07,759 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:50:07,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:07 WrapperNode [2022-02-20 23:50:07,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:50:07,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:07,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:50:07,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:50:07,766 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:07" (1/1) ... [2022-02-20 23:50:07,797 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:07" (1/1) ... [2022-02-20 23:50:07,820 INFO L137 Inliner]: procedures = 167, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 53 [2022-02-20 23:50:07,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:50:07,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:50:07,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:50:07,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:50:07,827 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:07" (1/1) ... [2022-02-20 23:50:07,827 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:07" (1/1) ... [2022-02-20 23:50:07,839 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:07" (1/1) ... [2022-02-20 23:50:07,840 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:07" (1/1) ... [2022-02-20 23:50:07,846 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:07" (1/1) ... [2022-02-20 23:50:07,861 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:07" (1/1) ... [2022-02-20 23:50:07,872 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:07" (1/1) ... [2022-02-20 23:50:07,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:50:07,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:50:07,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:50:07,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:50:07,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:07" (1/1) ... [2022-02-20 23:50:07,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:50:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:50:07,923 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:07,933 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:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:50:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-02-20 23:50:07,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-02-20 23:50:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:50:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2022-02-20 23:50:07,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:50:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:50:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2022-02-20 23:50:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2022-02-20 23:50:07,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:50:07,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:50:08,094 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:50:08,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:50:08,398 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:50:08,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:50:08,404 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:50:08,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:08 BoogieIcfgContainer [2022-02-20 23:50:08,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:50:08,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:50:08,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:50:08,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:50:08,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:50:07" (1/3) ... [2022-02-20 23:50:08,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d733ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:08, skipping insertion in model container [2022-02-20 23:50:08,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:50:07" (2/3) ... [2022-02-20 23:50:08,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d733ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:50:08, skipping insertion in model container [2022-02-20 23:50:08,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:50:08" (3/3) ... [2022-02-20 23:50:08,413 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test13_2.i [2022-02-20 23:50:08,417 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:50:08,417 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-02-20 23:50:08,443 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:50:08,448 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:08,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-02-20 23:50:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 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:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:08,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:08,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:08,469 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 25 more)] === [2022-02-20 23:50:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123929, now seen corresponding path program 1 times [2022-02-20 23:50:08,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:08,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755111995] [2022-02-20 23:50:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:08,523 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:08,568 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:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:08,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:08,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:08,857 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:08,858 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:08,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#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); {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:08,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#(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; {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:08,938 INFO L272 TraceCheckUtils]: 2: Hoare triple {90#(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); {97#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:08,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {97#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {97#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:08,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {97#(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; {104#(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:08,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#(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; {104#(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:08,948 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {104#(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|)))} {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #102#return; {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:08,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#(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; {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:08,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#(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; {90#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:08,951 INFO L272 TraceCheckUtils]: 9: Hoare triple {90#(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); {120#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ldv_list_add_#in~head.base|))} is VALID [2022-02-20 23:50:08,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {120#(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; {124#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:08,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {124#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) ldv_list_add_~head.base))} assume !(1bv1 == #valid[~head.base]); {86#false} is VALID [2022-02-20 23:50:08,954 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:08,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:08,954 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:08,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755111995] [2022-02-20 23:50:08,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755111995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:08,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:08,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:08,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758704019] [2022-02-20 23:50:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:08,962 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:08,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:08,966 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:08,979 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:08,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:50:08,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:50:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:08,996 INFO L87 Difference]: Start difference. First operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 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:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:09,884 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-02-20 23:50:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:09,885 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:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:09,886 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:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-02-20 23:50:09,893 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:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-02-20 23:50:09,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-02-20 23:50:10,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:10,008 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:50:10,008 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 23:50:10,009 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:10,012 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:10,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 104 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2022-02-20 23:50:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 23:50:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-02-20 23:50:10,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:10,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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:10,034 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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:10,034 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,039 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-02-20 23:50:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-02-20 23:50:10,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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 80 states. [2022-02-20 23:50:10,041 INFO L87 Difference]: Start difference. First operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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 80 states. [2022-02-20 23:50:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,045 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-02-20 23:50:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-02-20 23:50:10,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:10,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 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:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-20 23:50:10,050 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 12 [2022-02-20 23:50:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:10,050 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-20 23:50:10,051 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:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:50:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:50:10,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:10,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:10,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:10,260 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:10,261 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 25 more)] === [2022-02-20 23:50:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123928, now seen corresponding path program 1 times [2022-02-20 23:50:10,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:10,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827913601] [2022-02-20 23:50:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:10,264 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:10,265 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:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:50:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:12,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:12,508 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:12,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#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); {462#(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:12,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(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; {462#(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:12,627 INFO L272 TraceCheckUtils]: 2: Hoare triple {462#(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); {469#(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:12,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {469#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {469#(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:12,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {469#(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; {476#(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:12,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {476#(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; {476#(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:12,632 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {476#(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)))} {462#(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)))} #102#return; {483#(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:12,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(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; {483#(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:12,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(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; {483#(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:12,634 INFO L272 TraceCheckUtils]: 9: Hoare triple {483#(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); {493#(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:12,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(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; {497#(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:12,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(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)); {458#false} is VALID [2022-02-20 23:50:12,635 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:12,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:12,635 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:12,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827913601] [2022-02-20 23:50:12,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827913601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:12,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:12,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:12,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422286763] [2022-02-20 23:50:12,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:12,637 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,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:12,638 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:12,651 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:12,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:12,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2022-02-20 23:50:12,653 INFO L87 Difference]: Start difference. First operand 78 states and 80 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:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,715 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:17,715 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:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:17,716 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:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-02-20 23:50:17,719 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:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-02-20 23:50:17,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2022-02-20 23:50:17,818 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:17,832 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:50:17,832 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:50:17,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=55, Invalid=124, Unknown=3, NotChecked=0, Total=182 [2022-02-20 23:50:17,838 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 124 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:17,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 107 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 198 Invalid, 0 Unknown, 67 Unchecked, 0.4s Time] [2022-02-20 23:50:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:50:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-02-20 23:50:17,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:17,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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:17,857 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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:17,857 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,884 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 23:50:17,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:17,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:17,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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 85 states. [2022-02-20 23:50:17,891 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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 85 states. [2022-02-20 23:50:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:17,895 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 23:50:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 23:50:17,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:17,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:17,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:17,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 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:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-02-20 23:50:17,898 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 12 [2022-02-20 23:50:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:17,898 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-02-20 23:50:17,899 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:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-02-20 23:50:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:17,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:17,900 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:17,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:18,100 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:18,101 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 25 more)] === [2022-02-20 23:50:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash 211575775, now seen corresponding path program 1 times [2022-02-20 23:50:18,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:18,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868159338] [2022-02-20 23:50:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:18,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:18,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:18,106 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:18,108 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:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:18,270 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:18,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#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); {848#(= (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:18,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#(= (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; {848#(= (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:18,304 INFO L272 TraceCheckUtils]: 2: Hoare triple {848#(= (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); {848#(= (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:18,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {848#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} ~size := #in~size; {848#(= (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:18,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {848#(= (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; {848#(= (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:18,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} assume true; {848#(= (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:18,307 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {848#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} {848#(= (select (select |#memory_$Pointer$.base| |~#global_list_13~0.base|) |~#global_list_13~0.offset|) |~#global_list_13~0.base|)} #102#return; {848#(= (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:18,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(= (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; {848#(= (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:18,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(= (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; {848#(= (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:18,313 INFO L272 TraceCheckUtils]: 9: Hoare triple {848#(= (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); {876#(= (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:18,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {876#(= (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; {880#(= (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:18,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#(= (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 {884#(= (select |#valid| |ldv_list_add_#t~mem14.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:18,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {884#(= (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); {888#(= (select |#valid| |__ldv_list_add_#in~next.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:18,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {888#(= (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; {892#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} is VALID [2022-02-20 23:50:18,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {892#(= (select |#valid| __ldv_list_add_~next.base) (_ bv1 1))} assume !(1bv1 == #valid[~next.base]); {844#false} is VALID [2022-02-20 23:50:18,316 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:18,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:18,316 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:18,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868159338] [2022-02-20 23:50:18,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868159338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:18,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:18,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:18,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400169999] [2022-02-20 23:50:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:18,317 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:18,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:18,318 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:18,330 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:18,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:18,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:18,331 INFO L87 Difference]: Start difference. First operand 76 states and 78 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:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,455 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-02-20 23:50:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:19,455 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:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:19,455 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:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2022-02-20 23:50:19,458 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:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2022-02-20 23:50:19,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 113 transitions. [2022-02-20 23:50:19,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:19,575 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:50:19,575 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:50:19,576 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:19,576 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:19,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 314 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:50:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2022-02-20 23:50:19,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:19,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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:19,580 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,582 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-02-20 23:50:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-02-20 23:50:19,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:19,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:19,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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 109 states. [2022-02-20 23:50:19,586 INFO L87 Difference]: Start difference. First operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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 109 states. [2022-02-20 23:50:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:19,592 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-02-20 23:50:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-02-20 23:50:19,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:19,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:19,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:19,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 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:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-02-20 23:50:19,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 15 [2022-02-20 23:50:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:19,595 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-02-20 23:50:19,595 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:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 23:50:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:19,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:19,595 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:19,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:19,802 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:19,803 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 25 more)] === [2022-02-20 23:50:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 211575776, now seen corresponding path program 1 times [2022-02-20 23:50:19,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:19,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432929070] [2022-02-20 23:50:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:19,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:19,805 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:19,806 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:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:19,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:50:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:19,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:22,111 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:22,316 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:22,319 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:22,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {1309#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); {1314#(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:22,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(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; {1314#(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:22,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {1314#(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); {1321#(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:22,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#(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; {1321#(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:22,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#(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; {1328#(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:22,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(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; {1328#(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:22,416 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1328#(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|))} {1314#(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|))} #102#return; {1335#(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:22,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1335#(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; {1335#(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:22,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1335#(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; {1335#(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:22,419 INFO L272 TraceCheckUtils]: 9: Hoare triple {1335#(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); {1345#(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:22,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {1345#(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; {1349#(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:22,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {1349#(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 {1353#(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:22,424 INFO L272 TraceCheckUtils]: 12: Hoare triple {1353#(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); {1357#(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:22,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1357#(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; {1361#(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:22,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {1361#(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))); {1310#false} is VALID [2022-02-20 23:50:22,426 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:22,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:22,426 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:22,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432929070] [2022-02-20 23:50:22,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432929070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:22,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:22,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:22,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382752102] [2022-02-20 23:50:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:22,427 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:22,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:22,428 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:22,448 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:22,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:50:22,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:50:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2022-02-20 23:50:22,449 INFO L87 Difference]: Start difference. First operand 75 states and 77 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:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,860 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-02-20 23:50:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:50:28,860 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:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:28,860 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:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 120 transitions. [2022-02-20 23:50:28,862 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:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 120 transitions. [2022-02-20 23:50:28,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 120 transitions. [2022-02-20 23:50:29,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:29,002 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:50:29,002 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:50:29,003 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:29,003 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 90 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:29,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 284 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 416 Invalid, 0 Unknown, 64 Unchecked, 0.9s Time] [2022-02-20 23:50:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:50:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2022-02-20 23:50:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:29,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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:29,007 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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:29,007 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,010 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-02-20 23:50:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-02-20 23:50:29,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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 112 states. [2022-02-20 23:50:29,011 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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 112 states. [2022-02-20 23:50:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,013 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-02-20 23:50:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-02-20 23:50:29,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:29,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 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:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-02-20 23:50:29,016 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 15 [2022-02-20 23:50:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:29,016 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-02-20 23:50:29,016 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:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-02-20 23:50:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:29,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:29,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:29,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:29,223 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:29,224 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1183663415, now seen corresponding path program 1 times [2022-02-20 23:50:29,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:29,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033586541] [2022-02-20 23:50:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:29,226 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:29,227 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:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:29,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:29,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:29,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {1794#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); {1794#true} is VALID [2022-02-20 23:50:29,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1794#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; {1794#true} is VALID [2022-02-20 23:50:29,311 INFO L272 TraceCheckUtils]: 2: Hoare triple {1794#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {1794#true} is VALID [2022-02-20 23:50:29,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {1794#true} ~size := #in~size; {1794#true} is VALID [2022-02-20 23:50:29,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {1794#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; {1811#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1811#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1811#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,314 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1811#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {1794#true} #102#return; {1818#(not (= |ULTIMATE.start_alloc_13_#t~ret38#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#(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; {1822#(not (= |ULTIMATE.start_alloc_13_~p~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {1822#(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); {1795#false} is VALID [2022-02-20 23:50:29,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {1795#false} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {1795#false} is VALID [2022-02-20 23:50:29,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1795#false} SUMMARY for call free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {1795#false} is VALID [2022-02-20 23:50:29,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {1795#false} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {1795#false} is VALID [2022-02-20 23:50:29,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {1795#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)), #length[free_unsafe_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset))); {1795#false} is VALID [2022-02-20 23:50:29,316 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:29,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:29,316 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:29,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033586541] [2022-02-20 23:50:29,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033586541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:29,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:29,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:29,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547156279] [2022-02-20 23:50:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:29,324 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:29,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:29,324 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:29,337 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:29,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:29,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:29,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:29,338 INFO L87 Difference]: Start difference. First operand 74 states and 76 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:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,734 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-20 23:50:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:29,734 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:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:29,734 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:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-20 23:50:29,737 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:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-02-20 23:50:29,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-02-20 23:50:29,827 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:29,828 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:50:29,828 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:50:29,828 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:29,829 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 359 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:29,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 359 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:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:50:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2022-02-20 23:50:29,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:29,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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:29,833 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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:29,833 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,835 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-20 23:50:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-20 23:50:29,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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 98 states. [2022-02-20 23:50:29,839 INFO L87 Difference]: Start difference. First operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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 98 states. [2022-02-20 23:50:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:29,841 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-20 23:50:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-20 23:50:29,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:29,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:29,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:29,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 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:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-20 23:50:29,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 13 [2022-02-20 23:50:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:29,846 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-20 23:50:29,846 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:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:50:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:29,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:29,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:29,856 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:30,053 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:30,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849418, now seen corresponding path program 1 times [2022-02-20 23:50:30,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:30,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570449358] [2022-02-20 23:50:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:30,058 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:30,059 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:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:50:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:30,355 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:30,360 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:30,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {2209#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); {2214#(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:30,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#(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; {2214#(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:30,404 INFO L272 TraceCheckUtils]: 2: Hoare triple {2214#(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); {2221#(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:30,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {2221#(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; {2221#(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:30,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {2221#(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; {2221#(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:30,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {2221#(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; {2221#(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:30,407 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2221#(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|))} {2214#(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|))} #102#return; {2214#(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:30,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#(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; {2214#(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:30,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(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); {2214#(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:30,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {2214#(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:30,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {2246#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:30,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {2246#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {2250#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (= (_ bv4294967292 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|))} is VALID [2022-02-20 23:50:30,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {2250#(and (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (= (_ bv4294967292 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)), #length[free_unsafe_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset))); {2210#false} is VALID [2022-02-20 23:50:30,410 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,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:30,410 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:30,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570449358] [2022-02-20 23:50:30,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570449358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:30,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:30,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:30,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249740676] [2022-02-20 23:50:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:30,411 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:30,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:30,411 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:30,425 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:30,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:30,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:30,426 INFO L87 Difference]: Start difference. First operand 78 states and 80 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:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,489 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:31,489 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:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:31,490 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:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:50:31,494 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:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:50:31,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2022-02-20 23:50:31,606 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:31,607 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:50:31,607 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:50:31,607 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:31,608 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 35 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:31,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 219 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:50:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:50:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2022-02-20 23:50:31,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:31,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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:31,612 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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:31,612 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,614 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:50:31,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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 103 states. [2022-02-20 23:50:31,615 INFO L87 Difference]: Start difference. First operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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 103 states. [2022-02-20 23:50:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:31,617 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:50:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:50:31,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:31,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:31,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:31,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 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:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-02-20 23:50:31,620 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 13 [2022-02-20 23:50:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:31,620 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-02-20 23:50:31,620 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:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-02-20 23:50:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:50:31,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:31,621 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:31,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:31,827 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:31,829 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849417, now seen corresponding path program 1 times [2022-02-20 23:50:31,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:31,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745050723] [2022-02-20 23:50:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:31,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:31,831 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:31,833 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:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:31,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:31,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:32,018 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:32,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {2652#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); {2657#(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:32,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2657#(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; {2657#(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:32,045 INFO L272 TraceCheckUtils]: 2: Hoare triple {2657#(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); {2664#(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:32,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {2664#(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; {2664#(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:32,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {2664#(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; {2664#(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:32,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {2664#(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; {2664#(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:32,047 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2664#(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|))} {2657#(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|))} #102#return; {2657#(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:32,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {2657#(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; {2657#(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:32,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {2657#(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); {2657#(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:32,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {2657#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {2657#(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:32,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {2657#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {2689#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|))} is VALID [2022-02-20 23:50:32,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {2689#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {2693#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|))} is VALID [2022-02-20 23:50:32,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(and (= (select |#valid| (_ bv2 32)) (_ bv1 1)) (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|))} assume !(1bv1 == #valid[free_unsafe_13_~p~1#1.base]); {2653#false} is VALID [2022-02-20 23:50:32,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:32,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:32,050 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:32,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745050723] [2022-02-20 23:50:32,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745050723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:32,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:32,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:32,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854431892] [2022-02-20 23:50:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:32,051 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:32,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:32,051 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:32,064 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:32,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:32,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:32,065 INFO L87 Difference]: Start difference. First operand 84 states and 87 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:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:32,901 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-20 23:50:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:32,902 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:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:32,903 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:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:50:32,905 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:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:50:32,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2022-02-20 23:50:33,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:33,007 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:50:33,007 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:50:33,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:33,008 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:33,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 170 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:50:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2022-02-20 23:50:33,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:33,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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,013 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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,013 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,014 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-20 23:50:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-02-20 23:50:33,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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 98 states. [2022-02-20 23:50:33,015 INFO L87 Difference]: Start difference. First operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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 98 states. [2022-02-20 23:50:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:33,017 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-02-20 23:50:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-02-20 23:50:33,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:33,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:33,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:33,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 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,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-02-20 23:50:33,019 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2022-02-20 23:50:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:33,019 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-02-20 23:50:33,019 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:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-02-20 23:50:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:33,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:33,019 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:33,028 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:33,228 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:33,228 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 25 more)] === [2022-02-20 23:50:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085508, now seen corresponding path program 1 times [2022-02-20 23:50:33,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:33,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407796822] [2022-02-20 23:50:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:33,230 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:33,231 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:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:33,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:33,310 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:33,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {3080#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); {3080#true} is VALID [2022-02-20 23:50:33,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#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; {3080#true} is VALID [2022-02-20 23:50:33,378 INFO L272 TraceCheckUtils]: 2: Hoare triple {3080#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3080#true} is VALID [2022-02-20 23:50:33,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {3080#true} ~size := #in~size; {3080#true} is VALID [2022-02-20 23:50:33,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {3080#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; {3097#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:33,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {3097#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {3097#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:33,380 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3097#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {3080#true} #102#return; {3104#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:33,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {3104#(= (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; {3108#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:33,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {3108#(= (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; {3108#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:33,382 INFO L272 TraceCheckUtils]: 9: Hoare triple {3108#(= (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); {3115#(= (_ bv1 1) (select |#valid| |ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:33,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {3115#(= (_ 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; {3119#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:33,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {3119#(= (_ 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 {3119#(= (_ bv1 1) (select |#valid| ldv_list_add_~new.base))} is VALID [2022-02-20 23:50:33,386 INFO L272 TraceCheckUtils]: 12: Hoare triple {3119#(= (_ 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); {3126#(= (select |#valid| |__ldv_list_add_#in~new.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:33,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {3126#(= (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; {3130#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(= (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 {3130#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} is VALID [2022-02-20 23:50:33,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {3130#(= (select |#valid| __ldv_list_add_~new.base) (_ bv1 1))} assume !(1bv1 == #valid[~new.base]); {3081#false} is VALID [2022-02-20 23:50:33,387 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,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:33,387 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:33,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407796822] [2022-02-20 23:50:33,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407796822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:33,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:33,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:50:33,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176636309] [2022-02-20 23:50:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:33,389 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:33,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:33,389 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:33,402 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:33,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:33,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:33,403 INFO L87 Difference]: Start difference. First operand 84 states and 86 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:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,717 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-20 23:50:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:34,718 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:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:34,718 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:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-02-20 23:50:34,720 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:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-02-20 23:50:34,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2022-02-20 23:50:34,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:34,836 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:50:34,836 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:50:34,836 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:34,836 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:34,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 355 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:50:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:50:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2022-02-20 23:50:34,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:34,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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:34,839 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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:34,840 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,842 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-20 23:50:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-20 23:50:34,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:34,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:34,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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 120 states. [2022-02-20 23:50:34,850 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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 120 states. [2022-02-20 23:50:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:34,853 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2022-02-20 23:50:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-02-20 23:50:34,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:34,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:34,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:34,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2022-02-20 23:50:34,856 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 16 [2022-02-20 23:50:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:34,856 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2022-02-20 23:50:34,857 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:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-02-20 23:50:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:34,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:34,857 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:34,881 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:35,064 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:35,064 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 25 more)] === [2022-02-20 23:50:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085507, now seen corresponding path program 1 times [2022-02-20 23:50:35,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:35,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668221280] [2022-02-20 23:50:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:35,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:35,067 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:35,069 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:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:35,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:35,144 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:35,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {3597#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); {3597#true} is VALID [2022-02-20 23:50:35,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {3597#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; {3597#true} is VALID [2022-02-20 23:50:35,336 INFO L272 TraceCheckUtils]: 2: Hoare triple {3597#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {3597#true} is VALID [2022-02-20 23:50:35,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {3597#true} ~size := #in~size; {3611#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:35,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {3611#(= 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; {3615#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:35,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {3615#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {3615#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:35,339 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3615#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {3597#true} #102#return; {3622#(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:35,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {3622#(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; {3626#(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:35,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {3626#(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; {3626#(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:35,353 INFO L272 TraceCheckUtils]: 9: Hoare triple {3626#(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); {3633#(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:35,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {3633#(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; {3637#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:35,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {3637#(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 {3637#(and (= (select |#length| ldv_list_add_~new.base) (_ bv12 32)) (= ldv_list_add_~new.offset (_ bv4 32)))} is VALID [2022-02-20 23:50:35,358 INFO L272 TraceCheckUtils]: 12: Hoare triple {3637#(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); {3644#(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:35,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {3644#(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; {3648#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:35,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {3648#(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 {3648#(and (= (_ bv4 32) __ldv_list_add_~new.offset) (= (select |#length| __ldv_list_add_~new.base) (_ bv12 32)))} is VALID [2022-02-20 23:50:35,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {3648#(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)); {3598#false} is VALID [2022-02-20 23:50:35,360 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,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:35,361 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:35,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668221280] [2022-02-20 23:50:35,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668221280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:35,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:35,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:50:35,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718652577] [2022-02-20 23:50:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:35,362 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:35,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:35,362 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:35,377 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:35,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:35,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:35,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:35,378 INFO L87 Difference]: Start difference. First operand 97 states and 103 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:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,039 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-20 23:50:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:37,040 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:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:37,040 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:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:50:37,042 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:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:50:37,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2022-02-20 23:50:37,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:37,155 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:50:37,155 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:50:37,155 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:37,155 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:37,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 479 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:50:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:50:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2022-02-20 23:50:37,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:37,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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:37,158 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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:37,158 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,160 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-20 23:50:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-02-20 23:50:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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 118 states. [2022-02-20 23:50:37,164 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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 118 states. [2022-02-20 23:50:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,172 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-02-20 23:50:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-02-20 23:50:37,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:37,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 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:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-02-20 23:50:37,186 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 16 [2022-02-20 23:50:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:37,187 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-02-20 23:50:37,187 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:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-02-20 23:50:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:50:37,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:37,188 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:37,196 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:37,394 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:37,394 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 25 more)] === [2022-02-20 23:50:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1902002789, now seen corresponding path program 1 times [2022-02-20 23:50:37,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:37,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253440456] [2022-02-20 23:50:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:37,396 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:37,417 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:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:37,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:37,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:37,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {4111#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); {4111#true} is VALID [2022-02-20 23:50:37,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {4111#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; {4111#true} is VALID [2022-02-20 23:50:37,512 INFO L272 TraceCheckUtils]: 2: Hoare triple {4111#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4111#true} is VALID [2022-02-20 23:50:37,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {4111#true} ~size := #in~size; {4111#true} is VALID [2022-02-20 23:50:37,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {4111#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4128#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {4128#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {4128#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,514 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4128#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {4111#true} #102#return; {4135#(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:37,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {4135#(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; {4139#(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:37,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {4139#(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; {4112#false} is VALID [2022-02-20 23:50:37,515 INFO L272 TraceCheckUtils]: 9: Hoare triple {4112#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); {4112#false} is VALID [2022-02-20 23:50:37,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {4112#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4112#false} is VALID [2022-02-20 23:50:37,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {4112#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4112#false} is VALID [2022-02-20 23:50:37,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {4112#false} call __ldv_list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem14.base, #t~mem14.offset); {4112#false} is VALID [2022-02-20 23:50:37,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {4112#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; {4112#false} is VALID [2022-02-20 23:50:37,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {4112#false} SUMMARY for call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~bvadd32(4bv32, ~next.offset), 4bv32); srcloc: L547 {4112#false} is VALID [2022-02-20 23:50:37,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {4112#false} assume !(1bv1 == #valid[~new.base]); {4112#false} is VALID [2022-02-20 23:50:37,516 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:37,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:37,516 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:37,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253440456] [2022-02-20 23:50:37,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253440456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:37,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:37,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:37,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253310071] [2022-02-20 23:50:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:37,517 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:37,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:37,518 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:37,531 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:37,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:37,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:37,532 INFO L87 Difference]: Start difference. First operand 97 states and 101 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:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,846 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:37,846 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:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:37,846 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:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-02-20 23:50:37,847 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:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-02-20 23:50:37,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-02-20 23:50:37,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:37,919 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:50:37,919 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 23:50:37,919 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:37,920 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 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:37,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 286 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:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 23:50:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-02-20 23:50:37,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:37,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,925 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,925 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,927 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-20 23:50:37,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,927 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:37,928 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-02-20 23:50:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-02-20 23:50:37,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:37,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:37,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:37,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 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:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-02-20 23:50:37,930 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 16 [2022-02-20 23:50:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:37,930 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-02-20 23:50:37,930 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:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-02-20 23:50:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:37,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:37,930 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:37,956 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:38,136 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:38,136 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 25 more)] === [2022-02-20 23:50:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018817, now seen corresponding path program 1 times [2022-02-20 23:50:38,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:38,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503127653] [2022-02-20 23:50:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:38,142 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:38,143 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:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:38,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:38,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#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); {4498#true} is VALID [2022-02-20 23:50:38,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#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; {4498#true} is VALID [2022-02-20 23:50:38,257 INFO L272 TraceCheckUtils]: 2: Hoare triple {4498#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4498#true} is VALID [2022-02-20 23:50:38,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {4498#true} ~size := #in~size; {4498#true} is VALID [2022-02-20 23:50:38,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {4498#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; {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4498#true} {4498#true} #102#return; {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {4498#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; {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {4498#true} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L272 TraceCheckUtils]: 9: Hoare triple {4498#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); {4498#true} is VALID [2022-02-20 23:50:38,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {4498#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {4498#true} is VALID [2022-02-20 23:50:38,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#true} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); srcloc: L559 {4536#(= (_ bv1 1) (select |#valid| ldv_list_add_~head.base))} is VALID [2022-02-20 23:50:38,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {4536#(= (_ 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); {4540#(= (select |#valid| |__ldv_list_add_#in~prev.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:38,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {4540#(= (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; {4544#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:38,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {4544#(= (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 {4544#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:38,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {4544#(= (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 {4544#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:38,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {4544#(= (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 {4544#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} is VALID [2022-02-20 23:50:38,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(= (select |#valid| __ldv_list_add_~prev.base) (_ bv1 1))} assume !(1bv1 == #valid[~prev.base]); {4499#false} is VALID [2022-02-20 23:50:38,272 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,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:38,273 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:38,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503127653] [2022-02-20 23:50:38,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503127653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:38,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:38,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:38,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210362251] [2022-02-20 23:50:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:38,274 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:38,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:38,274 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:38,289 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:38,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:38,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:38,290 INFO L87 Difference]: Start difference. First operand 80 states and 81 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:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,689 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:50:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:38,689 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:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:38,689 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:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 23:50:38,691 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:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 23:50:38,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-02-20 23:50:38,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:38,748 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:50:38,748 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:50:38,748 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:38,749 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:38,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:50:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-02-20 23:50:38,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:38,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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:38,753 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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:38,753 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,754 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:50:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-02-20 23:50:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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 79 states. [2022-02-20 23:50:38,756 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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 79 states. [2022-02-20 23:50:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:38,758 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:50:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-02-20 23:50:38,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:38,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:38,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:38,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 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:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-02-20 23:50:38,760 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 18 [2022-02-20 23:50:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:38,760 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-02-20 23:50:38,760 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:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-02-20 23:50:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:38,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:38,761 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:38,784 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:38,968 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:38,968 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 25 more)] === [2022-02-20 23:50:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018816, now seen corresponding path program 1 times [2022-02-20 23:50:38,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:38,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940596357] [2022-02-20 23:50:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:38,971 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:38,972 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:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:39,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:39,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:39,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {4874#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); {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#(= |~#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; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,184 INFO L272 TraceCheckUtils]: 2: Hoare triple {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} ~size := #in~size; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {4879#(= |~#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; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} assume true; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,185 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} #102#return; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#(= |~#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; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} assume alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32; {4879#(= |~#global_list_13~0.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:39,187 INFO L272 TraceCheckUtils]: 9: Hoare triple {4879#(= |~#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); {4907#(= (_ bv0 32) |ldv_list_add_#in~head.offset|)} is VALID [2022-02-20 23:50:39,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {4907#(= (_ 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; {4911#(= ldv_list_add_~head.offset (_ bv0 32))} is VALID [2022-02-20 23:50:39,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {4911#(= 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 {4915#(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:39,189 INFO L272 TraceCheckUtils]: 12: Hoare triple {4915#(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); {4919#(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:39,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {4919#(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; {4923#(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:39,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {4923#(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 {4923#(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:39,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {4923#(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 {4923#(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:39,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {4923#(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 {4923#(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:39,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {4923#(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)); {4875#false} is VALID [2022-02-20 23:50:39,196 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,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:39,196 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:39,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940596357] [2022-02-20 23:50:39,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940596357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:39,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:39,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:39,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282296279] [2022-02-20 23:50:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:39,198 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:39,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:39,198 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:39,214 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:39,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:39,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:39,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:39,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:39,215 INFO L87 Difference]: Start difference. First operand 79 states and 80 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:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,224 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:50:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:40,224 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:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:40,224 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:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-02-20 23:50:40,225 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:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-02-20 23:50:40,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2022-02-20 23:50:40,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:40,301 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:50:40,301 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:50:40,301 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:40,301 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 282 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.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:40,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 282 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:50:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 23:50:40,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:40,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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:40,305 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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:40,305 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,306 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:50:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:50:40,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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 78 states. [2022-02-20 23:50:40,308 INFO L87 Difference]: Start difference. First operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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 78 states. [2022-02-20 23:50:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:40,309 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-02-20 23:50:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:50:40,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:40,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:40,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:40,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 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:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-20 23:50:40,312 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 18 [2022-02-20 23:50:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:40,312 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-20 23:50:40,312 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:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-20 23:50:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:50:40,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:40,312 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:40,335 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:40,522 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:40,522 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 25 more)] === [2022-02-20 23:50:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226599, now seen corresponding path program 1 times [2022-02-20 23:50:40,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:40,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375632140] [2022-02-20 23:50:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:40,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:40,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:40,524 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:40,525 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:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:40,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:40,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {5257#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); {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {5262#(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; {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,765 INFO L272 TraceCheckUtils]: 2: Hoare triple {5262#(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); {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:40,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:40,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:40,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} assume true; {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:40,767 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5269#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #102#return; {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {5262#(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; {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {5262#(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); {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} SUMMARY for call free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume { :end_inline_free_unsafe_13 } true; {5262#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,772 INFO L272 TraceCheckUtils]: 16: Hoare triple {5262#(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); {5312#(and (= (_ bv2 32) |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {5312#(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; {5316#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:40,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {5316#(and (= (_ bv2 32) LDV_INIT_LIST_HEAD_~list.base) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} assume !(1bv1 == #valid[~list.base]); {5258#false} is VALID [2022-02-20 23:50:40,773 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,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:40,773 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:40,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375632140] [2022-02-20 23:50:40,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375632140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:40,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:40,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:40,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103679424] [2022-02-20 23:50:40,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:40,774 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:40,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:40,774 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:40,791 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:40,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:40,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:40,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:40,792 INFO L87 Difference]: Start difference. First operand 78 states and 79 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:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,420 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:50:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:41,421 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:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:41,421 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:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-20 23:50:41,422 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:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-20 23:50:41,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-20 23:50:41,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,505 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:50:41,505 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:50:41,505 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:41,506 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:41,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 82 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:50:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:50:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-20 23:50:41,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:41,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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:41,509 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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:41,509 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,511 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:50:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-20 23:50:41,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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 76 states. [2022-02-20 23:50:41,512 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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 76 states. [2022-02-20 23:50:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,513 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:50:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-20 23:50:41,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:41,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 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:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-02-20 23:50:41,515 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 19 [2022-02-20 23:50:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:41,515 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-02-20 23:50:41,518 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:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-20 23:50:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:50:41,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:41,519 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:41,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,726 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:41,726 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 25 more)] === [2022-02-20 23:50:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226600, now seen corresponding path program 1 times [2022-02-20 23:50:41,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:41,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036343817] [2022-02-20 23:50:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:41,728 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:41,730 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:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:41,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:42,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {5629#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); {5634#(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:42,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {5634#(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; {5634#(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:42,021 INFO L272 TraceCheckUtils]: 2: Hoare triple {5634#(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); {5641#(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:42,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {5641#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {5641#(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:42,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {5641#(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; {5641#(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:42,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {5641#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume true; {5641#(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:42,027 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5641#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} {5634#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} #102#return; {5634#(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:42,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {5634#(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; {5634#(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:42,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {5634#(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); {5634#(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:42,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {5634#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {5634#(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:42,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {5634#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {5634#(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:42,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {5634#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {5634#(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:42,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {5634#(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_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {5634#(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:42,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {5634#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {5634#(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:42,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {5634#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)))} assume !(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {5634#(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:42,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {5634#(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_unsafe_13 } true; {5634#(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:42,031 INFO L272 TraceCheckUtils]: 16: Hoare triple {5634#(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); {5684#(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:42,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {5684#(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; {5688#(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:42,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {5688#(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)); {5630#false} is VALID [2022-02-20 23:50:42,032 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:42,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:42,032 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:42,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036343817] [2022-02-20 23:50:42,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036343817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:42,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:42,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:42,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056658549] [2022-02-20 23:50:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:42,034 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:42,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:42,034 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:42,059 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:42,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:42,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:42,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:42,060 INFO L87 Difference]: Start difference. First operand 76 states and 77 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:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,854 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-02-20 23:50:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:42,854 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:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:42,855 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:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-02-20 23:50:42,857 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:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-02-20 23:50:42,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-02-20 23:50:42,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,953 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:50:42,953 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:50:42,953 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:42,954 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:42,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 202 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:50:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:50:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-02-20 23:50:42,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:42,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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:42,958 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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:42,958 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,959 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-02-20 23:50:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-02-20 23:50:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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 86 states. [2022-02-20 23:50:42,960 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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 86 states. [2022-02-20 23:50:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,961 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-02-20 23:50:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-02-20 23:50:42,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:42,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 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:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-02-20 23:50:42,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 19 [2022-02-20 23:50:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:42,963 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-02-20 23:50:42,963 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:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-02-20 23:50:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:50:42,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:42,964 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:42,973 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:43,170 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:43,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 59862981, now seen corresponding path program 1 times [2022-02-20 23:50:43,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:43,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928409158] [2022-02-20 23:50:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:43,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:43,196 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:43,197 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:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:43,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {6038#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); {6038#true} is VALID [2022-02-20 23:50:43,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {6038#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; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,357 INFO L272 TraceCheckUtils]: 2: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {6050#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:43,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {6050#(= |old(#valid)| |#valid|)} ~size := #in~size; {6050#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:43,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {6050#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {6050#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:43,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {6050#(= |old(#valid)| |#valid|)} assume true; {6050#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:43,359 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6050#(= |old(#valid)| |#valid|)} {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #102#return; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {6046#(= |#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; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(alloc_13_~p~0#1.base != 0bv32 || alloc_13_~p~0#1.offset != 0bv32); {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_alloc_13 } true;assume { :begin_inline_free_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_free_unsafe_13 } true; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,362 INFO L272 TraceCheckUtils]: 16: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {6038#true} is VALID [2022-02-20 23:50:43,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {6038#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {6038#true} is VALID [2022-02-20 23:50:43,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {6038#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {6038#true} is VALID [2022-02-20 23:50:43,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {6038#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {6038#true} is VALID [2022-02-20 23:50:43,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:50:43,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6038#true} {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #108#return; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:43,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {6046#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {6039#false} is VALID [2022-02-20 23:50:43,367 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:43,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:43,367 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:43,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928409158] [2022-02-20 23:50:43,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928409158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:43,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:43,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:50:43,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361039871] [2022-02-20 23:50:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:43,368 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:43,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:43,369 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:43,386 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:43,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:50:43,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:50:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:50:43,387 INFO L87 Difference]: Start difference. First operand 83 states and 84 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:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,765 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2022-02-20 23:50:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:50:43,765 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:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:43,766 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:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-02-20 23:50:43,766 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:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-02-20 23:50:43,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-02-20 23:50:43,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:43,844 INFO L225 Difference]: With dead ends: 85 [2022-02-20 23:50:43,844 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:50:43,844 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:43,844 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:43,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:50:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 23:50:43,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:43,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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:43,846 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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:43,846 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,847 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-02-20 23:50:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-02-20 23:50:43,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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 66 states. [2022-02-20 23:50:43,847 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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 66 states. [2022-02-20 23:50:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,848 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-02-20 23:50:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-02-20 23:50:43,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:43,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 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:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-02-20 23:50:43,849 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 24 [2022-02-20 23:50:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:43,849 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-02-20 23:50:43,849 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:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-02-20 23:50:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:43,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:43,850 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:43,859 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:44,050 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:44,050 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -929247957, now seen corresponding path program 1 times [2022-02-20 23:50:44,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:44,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924428375] [2022-02-20 23:50:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:44,052 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:44,054 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:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:44,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:50:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:44,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:44,160 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,416 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,421 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,607 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,610 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,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {6396#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); {6396#true} is VALID [2022-02-20 23:50:44,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {6396#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; {6396#true} is VALID [2022-02-20 23:50:44,685 INFO L272 TraceCheckUtils]: 2: Hoare triple {6396#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {6396#true} is VALID [2022-02-20 23:50:44,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {6396#true} ~size := #in~size; {6410#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:44,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {6410#(= 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; {6414#(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,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {6414#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6414#(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,688 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6414#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {6396#true} #102#return; {6421#(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,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {6421#(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; {6425#(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,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#(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; {6425#(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,690 INFO L272 TraceCheckUtils]: 9: Hoare triple {6425#(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); {6432#(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:44,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {6432#(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; {6436#(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:44,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {6436#(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 {6436#(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:44,693 INFO L272 TraceCheckUtils]: 12: Hoare triple {6436#(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); {6432#(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:44,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {6432#(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; {6446#(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:44,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {6446#(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 {6446#(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:44,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {6446#(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 {6446#(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:44,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {6446#(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 {6446#(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:44,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {6446#(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 {6459#(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:44,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {6459#(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; {6459#(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:44,700 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6459#(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|)))} {6436#(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|))} #100#return; {6466#(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:44,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {6466#(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; {6466#(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:44,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {6466#(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; {6466#(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:44,702 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6466#(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|))} {6425#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #104#return; {6476#(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,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {6476#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {6476#(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,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {6476#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {6483#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {6483#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {6487#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:44,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {6487#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)), #length[free_unsafe_13_~p~1#1.base]) && ~bvule32(~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset))); {6397#false} is VALID [2022-02-20 23:50:44,705 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,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:44,705 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:44,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924428375] [2022-02-20 23:50:44,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924428375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:44,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:44,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:50:44,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505163287] [2022-02-20 23:50:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:44,706 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:44,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:44,706 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:44,742 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:44,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:50:44,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:44,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:50:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:44,743 INFO L87 Difference]: Start difference. First operand 66 states and 66 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:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,421 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-20 23:50:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:50:45,421 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:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,421 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:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-02-20 23:50:45,422 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:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-02-20 23:50:45,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-02-20 23:50:45,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,496 INFO L225 Difference]: With dead ends: 69 [2022-02-20 23:50:45,496 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 23:50:45,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:45,497 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:45,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 297 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2022-02-20 23:50:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 23:50:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-02-20 23:50:45,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:45,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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:45,499 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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:45,499 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,500 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-20 23:50:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-20 23:50:45,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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 69 states. [2022-02-20 23:50:45,501 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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 69 states. [2022-02-20 23:50:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,502 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-20 23:50:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-20 23:50:45,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:45,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 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:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-02-20 23:50:45,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 27 [2022-02-20 23:50:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:45,503 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-02-20 23:50:45,503 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:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-02-20 23:50:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:45,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:45,504 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:45,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-02-20 23:50:45,714 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:45,714 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -929247958, now seen corresponding path program 1 times [2022-02-20 23:50:45,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:45,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676018846] [2022-02-20 23:50:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:45,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:45,717 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:45,718 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:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:45,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:50:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:45,815 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:45,988 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,110 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:46,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {6764#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); {6764#true} is VALID [2022-02-20 23:50:46,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {6764#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; {6764#true} is VALID [2022-02-20 23:50:46,147 INFO L272 TraceCheckUtils]: 2: Hoare triple {6764#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {6764#true} is VALID [2022-02-20 23:50:46,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {6764#true} ~size := #in~size; {6764#true} is VALID [2022-02-20 23:50:46,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {6764#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; {6781#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:46,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {6781#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {6781#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:46,149 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6781#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {6764#true} #102#return; {6788#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:46,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {6788#(= (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; {6792#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:46,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {6792#(= (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; {6792#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:46,151 INFO L272 TraceCheckUtils]: 9: Hoare triple {6792#(= (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); {6799#(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:46,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {6799#(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; {6803#(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:46,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {6803#(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 {6803#(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:46,153 INFO L272 TraceCheckUtils]: 12: Hoare triple {6803#(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); {6799#(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:46,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {6799#(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; {6813#(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:46,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {6813#(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 {6813#(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:46,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(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 {6813#(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:46,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(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 {6813#(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:46,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {6813#(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 {6826#(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:46,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {6826#(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; {6826#(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:46,159 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6826#(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))))} {6803#(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))))} #100#return; {6833#(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:46,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {6833#(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; {6833#(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:46,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {6833#(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; {6833#(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:46,161 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6833#(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))))} {6792#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} #104#return; {6843#(= (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:46,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {6843#(= (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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {6843#(= (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:46,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {6843#(= (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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {6850#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:46,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {6850#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)) (_ bv1 1)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {6854#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:46,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {6854#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[free_unsafe_13_~p~1#1.base]); {6765#false} is VALID [2022-02-20 23:50:46,163 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,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:46,163 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:46,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676018846] [2022-02-20 23:50:46,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676018846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:46,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:46,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:50:46,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57110904] [2022-02-20 23:50:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:46,164 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:46,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:46,164 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:46,194 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:46,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:50:46,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:50:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:50:46,195 INFO L87 Difference]: Start difference. First operand 65 states and 65 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:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,481 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-02-20 23:50:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:50:46,481 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:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:46,481 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:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-02-20 23:50:46,482 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:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-02-20 23:50:46,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 72 transitions. [2022-02-20 23:50:46,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:46,552 INFO L225 Difference]: With dead ends: 68 [2022-02-20 23:50:46,552 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 23:50:46,552 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:46,553 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:46,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2022-02-20 23:50:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 23:50:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2022-02-20 23:50:46,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:46,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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:46,554 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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:46,555 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,555 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-02-20 23:50:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 23:50:46,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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 68 states. [2022-02-20 23:50:46,556 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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 68 states. [2022-02-20 23:50:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,557 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-02-20 23:50:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 23:50:46,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:46,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 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:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-02-20 23:50:46,559 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 27 [2022-02-20 23:50:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:46,559 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-02-20 23:50:46,559 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:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:50:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:46,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:46,560 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:46,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-02-20 23:50:46,767 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:46,767 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 25 more)] === [2022-02-20 23:50:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353082, now seen corresponding path program 1 times [2022-02-20 23:50:46,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:46,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980419037] [2022-02-20 23:50:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:46,769 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:46,783 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:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,890 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:47,077 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:47,161 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:47,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {7127#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); {7127#true} is VALID [2022-02-20 23:50:47,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {7127#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; {7127#true} is VALID [2022-02-20 23:50:47,223 INFO L272 TraceCheckUtils]: 2: Hoare triple {7127#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {7127#true} is VALID [2022-02-20 23:50:47,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {7127#true} ~size := #in~size; {7127#true} is VALID [2022-02-20 23:50:47,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {7127#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; {7144#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:47,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {7144#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:47,225 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7144#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {7127#true} #102#return; {7151#(= (select |#valid| |ULTIMATE.start_alloc_13_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {7151#(= (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; {7155#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {7155#(= (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; {7155#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,227 INFO L272 TraceCheckUtils]: 9: Hoare triple {7155#(= (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); {7162#(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:47,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {7162#(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; {7166#(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:47,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {7166#(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 {7166#(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:47,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {7166#(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); {7162#(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:47,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {7162#(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; {7176#(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:47,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {7176#(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 {7176#(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:47,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {7176#(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 {7176#(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:47,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {7176#(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 {7176#(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:47,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#(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 {7189#(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:47,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {7189#(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; {7189#(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:47,234 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7189#(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))))} {7166#(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))))} #100#return; {7196#(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:47,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {7196#(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; {7196#(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:47,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {7196#(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; {7196#(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:47,235 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7196#(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))))} {7155#(= (select |#valid| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv1 1))} #104#return; {7206#(= (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:47,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {7206#(= (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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {7206#(= (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:47,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {7206#(= (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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {7213#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {7213#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)) (_ bv1 1)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,238 INFO L272 TraceCheckUtils]: 29: Hoare triple {7217#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (_ bv1 1)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {7230#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_#in~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {7230#(= (_ 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; {7234#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:50:47,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {7234#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ldv_list_del_~entry#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[~entry#1.base]); {7128#false} is VALID [2022-02-20 23:50:47,239 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:47,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:47,239 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:47,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980419037] [2022-02-20 23:50:47,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980419037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:47,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:47,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:50:47,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606808144] [2022-02-20 23:50:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:47,240 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:47,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:47,240 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:47,268 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:47,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:50:47,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:50:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:47,269 INFO L87 Difference]: Start difference. First operand 64 states and 64 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:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,085 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-02-20 23:50:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:48,086 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:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:48,086 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:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2022-02-20 23:50:48,088 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:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2022-02-20 23:50:48,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2022-02-20 23:50:48,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:48,168 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:50:48,168 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:50:48,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:50:48,169 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:48,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 296 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2022-02-20 23:50:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:50:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-02-20 23:50:48,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:48,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,172 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,172 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,184 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-02-20 23:50:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-02-20 23:50:48,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,186 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,187 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-02-20 23:50:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-02-20 23:50:48,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:48,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 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:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-02-20 23:50:48,189 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 32 [2022-02-20 23:50:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:48,189 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-02-20 23:50:48,189 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:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-02-20 23:50:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:50:48,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:48,190 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:48,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:48,397 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:48,397 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 25 more)] === [2022-02-20 23:50:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353083, now seen corresponding path program 1 times [2022-02-20 23:50:48,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:48,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651895308] [2022-02-20 23:50:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:48,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:48,399 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:48,438 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:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-20 23:50:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:48,529 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:48,778 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:48,785 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:48,983 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:48,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 17 treesize of output 9 [2022-02-20 23:50:49,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {7561#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); {7561#true} is VALID [2022-02-20 23:50:49,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {7561#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; {7561#true} is VALID [2022-02-20 23:50:49,139 INFO L272 TraceCheckUtils]: 2: Hoare triple {7561#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {7561#true} is VALID [2022-02-20 23:50:49,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {7561#true} ~size := #in~size; {7575#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:49,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {7575#(= 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; {7579#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {7579#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {7579#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,141 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7579#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {7561#true} #102#return; {7586#(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:49,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {7586#(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; {7590#(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:49,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {7590#(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; {7590#(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:49,143 INFO L272 TraceCheckUtils]: 9: Hoare triple {7590#(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); {7597#(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:49,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {7597#(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; {7601#(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:49,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#(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 {7601#(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:49,145 INFO L272 TraceCheckUtils]: 12: Hoare triple {7601#(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); {7597#(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:49,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {7597#(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; {7611#(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:49,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {7611#(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 {7611#(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:49,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {7611#(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 {7611#(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:49,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {7611#(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 {7611#(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:49,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {7611#(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 {7624#(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:49,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {7624#(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; {7624#(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:49,151 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7624#(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|)))} {7601#(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|))} #100#return; {7631#(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:49,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {7631#(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; {7631#(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:49,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {7631#(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; {7631#(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:49,153 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7631#(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|))} {7590#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #104#return; {7641#(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:49,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {7641#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {7641#(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:49,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {7641#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {7648#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:49,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {7648#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:49,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:49,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:49,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:49,156 INFO L272 TraceCheckUtils]: 29: Hoare triple {7652#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {7665#(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:49,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {7665#(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; {7669#(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:49,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {7669#(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))); {7562#false} is VALID [2022-02-20 23:50:49,157 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:49,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:49,157 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:49,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651895308] [2022-02-20 23:50:49,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651895308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:49,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:49,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:50:49,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477313041] [2022-02-20 23:50:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:49,158 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:49,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:49,158 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:49,195 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:49,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:50:49,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:50:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:50:49,196 INFO L87 Difference]: Start difference. First operand 74 states and 81 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:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,006 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:50:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:50,006 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:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:50,006 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:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-02-20 23:50:50,007 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:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-02-20 23:50:50,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-02-20 23:50:50,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:50,092 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:50:50,092 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:50:50,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:50:50,092 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:50,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 331 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2022-02-20 23:50:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:50:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-02-20 23:50:50,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:50,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,094 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,094 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,095 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:50:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-02-20 23:50:50,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,095 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:50,096 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-02-20 23:50:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-02-20 23:50:50,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:50,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:50,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:50,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 62 states have internal predecessors, (68), 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:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-02-20 23:50:50,097 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 32 [2022-02-20 23:50:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:50,098 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-02-20 23:50:50,098 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:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-02-20 23:50:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:50:50,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:50,098 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:50,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-02-20 23:50:50,305 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:50,305 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 25 more)] === [2022-02-20 23:50:50,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:50,306 INFO L85 PathProgramCache]: Analyzing trace with hash -193116151, now seen corresponding path program 1 times [2022-02-20 23:50:50,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:50,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155925443] [2022-02-20 23:50:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:50,307 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:50,310 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:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:50:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:50,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:50,477 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:50,478 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:50,656 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,763 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:50,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {7994#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); {7999#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:50,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {7999#(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; {7999#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} is VALID [2022-02-20 23:50:50,833 INFO L272 TraceCheckUtils]: 2: Hoare triple {7999#(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); {8006#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:50,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {8006#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {8006#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:50:50,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {8006#(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; {8013#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} is VALID [2022-02-20 23:50:50,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {8013#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} assume true; {8013#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} is VALID [2022-02-20 23:50:50,835 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8013#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)))} {7999#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (select |#valid| (_ bv2 32)) (_ bv1 1)))} #102#return; {8020#(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:50,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {8020#(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; {8024#(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:50,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {8024#(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; {8024#(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:50,837 INFO L272 TraceCheckUtils]: 9: Hoare triple {8024#(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); {8031#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:50,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {8031#(= (_ 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; {8035#(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:50,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {8035#(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 {8035#(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:50,839 INFO L272 TraceCheckUtils]: 12: Hoare triple {8035#(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); {8031#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:50:50,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {8031#(= (_ 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; {8045#(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:50,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {8045#(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 {8045#(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:50,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#(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 {8045#(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:50,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#(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 {8045#(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:50,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#(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 {8058#(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:50,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {8058#(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; {8058#(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:50,851 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8058#(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|)))} {8035#(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|))} #100#return; {8065#(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:50,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {8065#(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; {8065#(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:50,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {8065#(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; {8065#(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:50,856 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8065#(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|))} {8024#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} #104#return; {8075#(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:50,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {8075#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {8075#(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:50,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {8082#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)))} is VALID [2022-02-20 23:50:50,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(and (= (_ bv2 32) |~#global_list_13~0.base|) (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:50,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:50,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:50,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {8086#(and (not (= (_ bv2 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|))} assume !(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {7995#false} is VALID [2022-02-20 23:50:50,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {7995#false} assume { :end_inline_free_unsafe_13 } true; {7995#false} is VALID [2022-02-20 23:50:50,859 INFO L272 TraceCheckUtils]: 30: Hoare triple {7995#false} call LDV_INIT_LIST_HEAD(~#global_list_13~0.base, ~#global_list_13~0.offset); {7995#false} is VALID [2022-02-20 23:50:50,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {7995#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {7995#false} is VALID [2022-02-20 23:50:50,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {7995#false} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {7995#false} is VALID [2022-02-20 23:50:50,859 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:50,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:50,859 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:50,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155925443] [2022-02-20 23:50:50,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155925443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:50,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:50,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:50:50,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122686714] [2022-02-20 23:50:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:50,860 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:50,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:50,860 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:50,896 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:50,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:50:50,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:50:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:50:50,897 INFO L87 Difference]: Start difference. First operand 74 states and 80 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:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,173 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:50:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:53,173 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:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:53,174 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:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-02-20 23:50:53,180 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:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-02-20 23:50:53,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2022-02-20 23:50:53,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:53,244 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:50:53,245 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:50:53,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:50:53,246 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 186 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:53,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 116 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:50:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:50:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-02-20 23:50:53,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:53,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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:53,253 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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:53,253 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,268 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:50:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:50:53,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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 78 states. [2022-02-20 23:50:53,269 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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 78 states. [2022-02-20 23:50:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:53,283 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:50:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:50:53,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:53,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:53,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-02-20 23:50:53,286 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 33 [2022-02-20 23:50:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:53,287 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-02-20 23:50:53,287 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:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-02-20 23:50:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:50:53,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:53,287 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:53,297 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:53,488 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:53,488 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -189727375, now seen corresponding path program 1 times [2022-02-20 23:50:53,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:53,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843465046] [2022-02-20 23:50:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:53,494 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:53,496 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:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-20 23:50:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:53,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:53,633 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:53,875 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:53,881 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,050 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:54,052 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:54,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {8441#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); {8441#true} is VALID [2022-02-20 23:50:54,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {8441#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; {8441#true} is VALID [2022-02-20 23:50:54,203 INFO L272 TraceCheckUtils]: 2: Hoare triple {8441#true} call alloc_13_#t~ret38#1.base, alloc_13_#t~ret38#1.offset := ldv_malloc(12bv32); {8441#true} is VALID [2022-02-20 23:50:54,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {8441#true} ~size := #in~size; {8455#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:54,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {8455#(= 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; {8459#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:54,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {8459#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {8459#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:54,205 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8459#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {8441#true} #102#return; {8466#(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:54,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {8466#(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; {8470#(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:54,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {8470#(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; {8470#(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:54,207 INFO L272 TraceCheckUtils]: 9: Hoare triple {8470#(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); {8477#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {8477#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ bv12 32)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset; {8481#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {8481#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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 {8481#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,209 INFO L272 TraceCheckUtils]: 12: Hoare triple {8481#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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); {8477#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {8477#(exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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; {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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 {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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 {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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 {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {8491#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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 {8504#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {8504#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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; {8504#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,215 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8504#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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|)))} {8481#(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_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ bv12 32))) (= ldv_list_add_~new.base |ldv_list_add_#in~new.base|) (= ldv_list_add_~new.offset |ldv_list_add_#in~new.offset|))} #100#return; {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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; {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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; {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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:54,217 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8511#(and (exists ((|v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_alloc_13_~p~0#1.base_BEFORE_CALL_8|) (_ 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|))} {8470#(and (= (select |#length| |ULTIMATE.start_alloc_13_~p~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #104#return; {8521#(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:54,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {8521#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {8521#(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:54,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {8521#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {8528#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {8528#(and (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base|) (_ bv12 32)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:50:54,220 INFO L272 TraceCheckUtils]: 29: Hoare triple {8532#(and (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (= (select |#length| |ULTIMATE.start_free_unsafe_13_~p~1#1.base|) (_ bv12 32)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {8545#(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:54,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {8545#(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; {8549#(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:54,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ 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 {8549#(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:54,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {8549#(and (= (select |#length| |ldv_list_del_~entry#1.base|) (_ bv12 32)) (= (_ bv4 32) |ldv_list_del_~entry#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~entry#1.offset), #length[~entry#1.base]) && ~bvule32(~entry#1.offset, ~bvadd32(4bv32, ~entry#1.offset))) && ~bvule32(0bv32, ~entry#1.offset)); {8442#false} is VALID [2022-02-20 23:50:54,221 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:54,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:54,222 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:54,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843465046] [2022-02-20 23:50:54,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843465046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:54,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:54,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:50:54,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009826584] [2022-02-20 23:50:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:54,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:54,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:54,257 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:54,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:50:54,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:50:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:50:54,259 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,063 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-02-20 23:50:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:50:55,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-02-20 23:50:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-02-20 23:50:55,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-02-20 23:50:55,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:55,146 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:50:55,147 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:50:55,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:50:55,147 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:55,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 257 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2022-02-20 23:50:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:50:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-02-20 23:50:55,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:55,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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:55,149 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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:55,149 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,150 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-02-20 23:50:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-02-20 23:50:55,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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 78 states. [2022-02-20 23:50:55,150 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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 78 states. [2022-02-20 23:50:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,151 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-02-20 23:50:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-02-20 23:50:55,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:55,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 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:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-02-20 23:50:55,152 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 33 [2022-02-20 23:50:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:55,152 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-02-20 23:50:55,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 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:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-02-20 23:50:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:50:55,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:55,153 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:55,175 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:55,360 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:55,360 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380463, now seen corresponding path program 1 times [2022-02-20 23:50:55,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:55,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393589452] [2022-02-20 23:50:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:55,363 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:55,364 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:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:55,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 23:50:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:55,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:55,611 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:55,611 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:55,678 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:55,930 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:56,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:56,006 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:56,051 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:50:56,052 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:56,064 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:56,368 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:56,445 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:56,741 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:50:56,741 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:56,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {8869#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); {8874#(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:56,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {8874#(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; {8874#(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:56,796 INFO L272 TraceCheckUtils]: 2: Hoare triple {8874#(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); {8881#(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:56,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {8881#(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; {8881#(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:56,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {8881#(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; {8888#(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:56,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {8888#(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; {8888#(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:56,798 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8888#(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|))} {8874#(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|))} #102#return; {8895#(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:56,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {8895#(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; {8899#(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:56,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {8899#(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; {8899#(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:56,800 INFO L272 TraceCheckUtils]: 9: Hoare triple {8899#(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); {8906#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:50:56,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {8906#(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; {8910#(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:56,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {8910#(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 {8914#(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:56,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {8914#(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); {8918#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:50:56,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {8918#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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; {8922#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {8922#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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) (= __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 {8922#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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) (= __ldv_list_add_~new.base |__ldv_list_add_#in~new.base|))} is VALID [2022-02-20 23:50:56,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {8922#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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) (= __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 {8929#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__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:56,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {8929#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__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 {8929#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__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:56,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {8929#(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_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ bv2 32) |~#global_list_13~0.base|) (= |__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 {8936#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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|)) (= |__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:56,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {8936#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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|)) (= |__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; {8936#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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|)) (= |__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:56,810 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8936#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_7|) (_ bv1 1))) (= (_ 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|)) (= |__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|))))} {8914#(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|))} #100#return; {8943#(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 (= (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,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {8943#(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 (= (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; {8943#(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 (= (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,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {8943#(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 (= (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; {8943#(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 (= (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,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8943#(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 (= (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|))} {8899#(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|))} #104#return; {8953#(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:56,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {8953#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {8953#(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:56,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {8953#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {8960#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (bvadd |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4294967292 32)) (_ 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|)) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)))))} is VALID [2022-02-20 23:50:56,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {8960#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (bvadd |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4294967292 32)) (_ 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|)) |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset|)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)))))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} is VALID [2022-02-20 23:50:56,819 INFO L272 TraceCheckUtils]: 29: Hoare triple {8964#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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|)) (_ bv4 32))) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|))))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {8977#(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:56,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {8977#(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; {8981#(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:56,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {8981#(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 {8981#(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:56,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {8981#(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 {8988#(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:56,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {8988#(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; {8992#(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:56,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#(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]); {8870#false} is VALID [2022-02-20 23:50:56,822 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,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:56,822 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:56,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393589452] [2022-02-20 23:50:56,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393589452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:56,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:56,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-20 23:50:56,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178273766] [2022-02-20 23:50:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:56,823 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:56,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:56,823 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:56,860 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,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:50:56,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:50:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:50:56,861 INFO L87 Difference]: Start difference. First operand 74 states and 78 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:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,773 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-20 23:50:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:50:58,773 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:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:58,774 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:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2022-02-20 23:50:58,774 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:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 78 transitions. [2022-02-20 23:50:58,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 78 transitions. [2022-02-20 23:50:58,867 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:58,867 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:50:58,868 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:50:58,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:50:58,868 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:58,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 421 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 327 Invalid, 0 Unknown, 221 Unchecked, 0.5s Time] [2022-02-20 23:50:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:50:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-02-20 23:50:58,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:58,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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:58,870 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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:58,870 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,871 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-20 23:50:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-20 23:50:58,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:58,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:58,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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 77 states. [2022-02-20 23:50:58,871 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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 77 states. [2022-02-20 23:50:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:58,872 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-20 23:50:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-20 23:50:58,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:58,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:58,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:58,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 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:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-02-20 23:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2022-02-20 23:50:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:58,874 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-02-20 23:50:58,874 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:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 23:50:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:50:58,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:58,875 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:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-02-20 23:50:59,075 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:50:59,075 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr5REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:50:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380462, now seen corresponding path program 1 times [2022-02-20 23:50:59,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:59,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377117939] [2022-02-20 23:50:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:59,084 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:50:59,085 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:50:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:59,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-20 23:50:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:59,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:59,377 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:59,377 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:59,465 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:59,475 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:59,848 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:59,857 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:59,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:59,941 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:59,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:59,973 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:51:00,020 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:51:00,020 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:51:00,056 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-20 23:51:00,057 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:51:00,449 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:51:00,453 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:51:00,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:00,851 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:51:00,871 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:51:00,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {9316#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); {9321#(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:51:00,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#(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; {9321#(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:51:00,945 INFO L272 TraceCheckUtils]: 2: Hoare triple {9321#(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); {9328#(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:51:00,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {9328#(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; {9328#(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:51:00,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {9328#(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; {9335#(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:51:00,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {9335#(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; {9335#(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:51:00,947 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9335#(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|))} {9321#(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|))} #102#return; {9342#(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:51:00,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {9342#(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; {9346#(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:51:00,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {9346#(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; {9346#(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:51:00,948 INFO L272 TraceCheckUtils]: 9: Hoare triple {9346#(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); {9353#(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:51:00,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {9353#(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; {9357#(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:51:00,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {9357#(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 {9361#(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:51:00,950 INFO L272 TraceCheckUtils]: 12: Hoare triple {9361#(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); {9365#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:00,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {9365#(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; {9369#(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:51:00,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {9369#(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 {9373#(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:51:00,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {9373#(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 {9377#(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:51:00,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {9377#(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 {9377#(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:51:00,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {9377#(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 {9384#(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:51:00,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {9384#(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; {9384#(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:51:00,961 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9384#(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|))))} {9361#(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|))} #100#return; {9391#(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:51:00,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {9391#(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; {9391#(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:51:00,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {9391#(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; {9391#(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:51:00,965 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9391#(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|))} {9346#(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|))} #104#return; {9401#(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:51:00,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {9401#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {9401#(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:51:00,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {9401#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {9408#(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))) (= (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_unsafe_13_#t~mem39#1.base|) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 23:51:00,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {9408#(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))) (= (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_unsafe_13_#t~mem39#1.base|) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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:51:00,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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 free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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:51:00,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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:51:00,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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:51:00,970 INFO L272 TraceCheckUtils]: 29: Hoare triple {9412#(and (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#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)) (not (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#1.base| (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)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {9425#(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)) (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:51:00,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {9425#(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)) (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {9429#(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:51:00,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {9429#(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 {9429#(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:51:00,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {9429#(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 {9436#(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:51:00,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {9436#(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; {9440#(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:51:00,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {9440#(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))); {9317#false} is VALID [2022-02-20 23:51:00,974 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:00,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:00,974 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:00,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377117939] [2022-02-20 23:51:00,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377117939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:00,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:00,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 23:51:00,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720195911] [2022-02-20 23:51:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:00,978 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:00,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:00,978 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:51:01,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:01,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 23:51:01,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 23:51:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:51:01,024 INFO L87 Difference]: Start difference. First operand 74 states and 77 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:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,855 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-02-20 23:51:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 23:51:06,855 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:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:06,856 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:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 77 transitions. [2022-02-20 23:51:06,856 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:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 77 transitions. [2022-02-20 23:51:06,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 77 transitions. [2022-02-20 23:51:06,971 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:51:06,972 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:51:06,972 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:51:06,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2022-02-20 23:51:06,972 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 115 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:06,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 406 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 23:51:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:51:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-02-20 23:51:06,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:06,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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:51:06,974 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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:51:06,974 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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:51:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,975 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-02-20 23:51:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-02-20 23:51:06,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:06,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:06,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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 76 states. [2022-02-20 23:51:06,976 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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 76 states. [2022-02-20 23:51:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:06,977 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-02-20 23:51:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-02-20 23:51:06,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:06,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:06,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:06,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 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:51:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-02-20 23:51:06,978 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 35 [2022-02-20 23:51:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:06,979 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-02-20 23:51:06,979 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:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-02-20 23:51:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:51:06,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:06,979 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:06,987 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:07,180 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:07,180 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:51:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 8747840, now seen corresponding path program 1 times [2022-02-20 23:51:07,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:07,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585304018] [2022-02-20 23:51:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:07,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:07,182 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:07,184 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:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:51:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:07,438 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:07,439 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:07,748 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:07,820 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:07,840 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 23:51:07,840 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:08,156 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:08,438 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:51:08,438 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:08,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {9783#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); {9788#(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:08,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {9788#(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; {9788#(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:08,514 INFO L272 TraceCheckUtils]: 2: Hoare triple {9788#(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); {9795#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:51:08,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {9795#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} ~size := #in~size; {9795#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:51:08,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {9795#(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; {9802#(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:08,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {9802#(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; {9802#(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:08,517 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9802#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {9788#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))))} #102#return; {9809#(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:08,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {9809#(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; {9813#(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:08,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {9813#(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; {9813#(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:08,518 INFO L272 TraceCheckUtils]: 9: Hoare triple {9813#(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); {9820#(= (_ bv2 32) |~#global_list_13~0.base|)} is VALID [2022-02-20 23:51:08,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {9820#(= (_ 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; {9824#(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:08,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {9824#(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 {9828#(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:08,521 INFO L272 TraceCheckUtils]: 12: Hoare triple {9828#(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); {9832#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ bv2 32) |~#global_list_13~0.base|))} is VALID [2022-02-20 23:51:08,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {9832#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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; {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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 {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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 {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {9836#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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 {9846#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {9846#(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_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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 {9850#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {9850#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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; {9850#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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:08,529 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9850#(and (exists ((|v_ldv_list_add_#in~head.base_BEFORE_CALL_9| (_ BitVec 32))) (= (_ bv1 1) (select |#valid| |v_ldv_list_add_#in~head.base_BEFORE_CALL_9|))) (= (_ 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|)))} {9828#(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|))} #100#return; {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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:08,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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; {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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:08,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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; {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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:08,531 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9857#(and (= (_ bv2 32) |~#global_list_13~0.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|)))) (= (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|))} {9813#(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|))} #104#return; {9867#(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:08,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {9867#(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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {9867#(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:08,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {9867#(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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {9874#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (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))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)))} is VALID [2022-02-20 23:51:08,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {9874#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (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))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)))) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (_ bv4 32)))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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:08,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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 free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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:08,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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))))))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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:08,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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))))))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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:08,539 INFO L272 TraceCheckUtils]: 29: Hoare triple {9878#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv4 32) (bvadd (_ bv4 32) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|)) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_free_unsafe_13_~p~1#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))))))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {9891#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |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|))) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv8 32))))) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} is VALID [2022-02-20 23:51:08,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {9891#(and (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (exists ((|~#global_list_13~0.offset| (_ BitVec 32))) (and (= |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|))) (= (_ bv2 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) |~#global_list_13~0.offset|)) (_ bv8 32))))) (= (_ bv4 32) |ldv_list_del_#in~entry#1.offset|))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {9895#(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:08,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {9895#(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 {9899#(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:08,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {9899#(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 {9899#(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:08,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {9899#(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; {9906#(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:08,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {9906#(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 {9906#(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:08,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {9906#(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]); {9784#false} is VALID [2022-02-20 23:51:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:08,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:08,543 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:08,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585304018] [2022-02-20 23:51:08,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585304018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:08,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:08,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-20 23:51:08,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896630722] [2022-02-20 23:51:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:08,544 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:08,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:08,544 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:08,601 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:08,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:51:08,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:51:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:51:08,601 INFO L87 Difference]: Start difference. First operand 74 states and 76 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:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,748 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-02-20 23:51:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:51:09,748 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:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:09,749 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:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-02-20 23:51:09,749 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:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-02-20 23:51:09,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2022-02-20 23:51:09,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:09,848 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:51:09,848 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:51:09,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-02-20 23:51:09,849 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:09,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 179 Unchecked, 0.3s Time] [2022-02-20 23:51:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:51:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-02-20 23:51:09,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:09,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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:51:09,851 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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:51:09,851 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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:51:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,852 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-02-20 23:51:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-02-20 23:51:09,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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 75 states. [2022-02-20 23:51:09,852 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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 75 states. [2022-02-20 23:51:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:09,853 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-02-20 23:51:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-02-20 23:51:09,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:09,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:09,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:09,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 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:51:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-02-20 23:51:09,854 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 36 [2022-02-20 23:51:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:09,854 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-02-20 23:51:09,854 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:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-02-20 23:51:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:51:09,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:09,855 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:09,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:10,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,055 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_list_delErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:51:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 8747841, now seen corresponding path program 1 times [2022-02-20 23:51:10,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:10,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705137479] [2022-02-20 23:51:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:10,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:10,068 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:10,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-02-20 23:51:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 23:51:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:10,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:10,379 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:51:10,379 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:10,390 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:51:10,707 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:10,718 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:10,800 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-20 23:51:10,801 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:10,842 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-02-20 23:51:10,843 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 30 [2022-02-20 23:51:11,634 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:11,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:51:11,640 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:11,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {10228#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); {10233#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {10233#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ 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; {10233#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:11,717 INFO L272 TraceCheckUtils]: 2: Hoare triple {10233#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ 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); {10240#(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:51:11,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {10240#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |~#global_list_13~0.offset| (_ bv0 32)))} ~size := #in~size; {10240#(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:51:11,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {10240#(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; {10247#(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)) (exists ((v_ArrVal_411 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_411))))} is VALID [2022-02-20 23:51:11,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {10247#(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)) (exists ((v_ArrVal_411 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_411))))} assume true; {10247#(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)) (exists ((v_ArrVal_411 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_411))))} is VALID [2022-02-20 23:51:11,720 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10247#(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)) (exists ((v_ArrVal_411 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_411))))} {10233#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (_ bv2 32))) (_ bv1 1))) (= |~#global_list_13~0.offset| (_ bv0 32)))} #102#return; {10254#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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:11,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {10254#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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; {10258#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:11,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {10258#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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; {10258#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} is VALID [2022-02-20 23:51:11,721 INFO L272 TraceCheckUtils]: 9: Hoare triple {10258#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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); {10265#(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:51:11,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {10265#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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; {10269#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= 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:11,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {10269#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= 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 {10269#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= 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:11,723 INFO L272 TraceCheckUtils]: 12: Hoare triple {10269#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= 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); {10265#(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:51:11,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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; {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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:11,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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 {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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:11,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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 {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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:11,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {10279#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |__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 {10289#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (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:11,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {10289#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (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 {10293#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (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:11,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {10293#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (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; {10293#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (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:11,741 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10293#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (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|)))} {10269#(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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= 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|))} #100#return; {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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:11,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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; {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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:11,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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; {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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:11,760 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10300#(and (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |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|))} {10258#(and (not (= (_ bv2 32) |ULTIMATE.start_alloc_13_~p~0#1.base|)) (= (_ bv2 32) |~#global_list_13~0.base|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#global_list_13~0.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_alloc_13_~p~0#1.offset|))} #104#return; {10310#(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))) (= (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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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:11,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {10310#(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))) (= (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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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_unsafe_13 } true;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset, free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset, free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset, free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset, free_unsafe_13_#t~mem41#1.base, free_unsafe_13_#t~mem41#1.offset, free_unsafe_13_~__mptr~6#1.base, free_unsafe_13_~__mptr~6#1.offset, free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset, free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset;havoc free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset;havoc free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset; {10310#(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))) (= (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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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:11,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {10310#(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))) (= (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|) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= |~#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_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset := read~$Pointer$(~#global_list_13~0.base, ~#global_list_13~0.offset, 4bv32); srcloc: L771 {10317#(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)) (= (_ 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$.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_unsafe_13_#t~mem39#1.base|) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} is VALID [2022-02-20 23:51:11,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {10317#(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)) (= (_ 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$.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_unsafe_13_#t~mem39#1.base|) (= |ULTIMATE.start_free_unsafe_13_#t~mem39#1.offset| (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))))} free_unsafe_13_~__mptr~4#1.base, free_unsafe_13_~__mptr~4#1.offset := free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;havoc free_unsafe_13_#t~mem39#1.base, free_unsafe_13_#t~mem39#1.offset;free_unsafe_13_~p~1#1.base, free_unsafe_13_~p~1#1.offset := free_unsafe_13_~__mptr~4#1.base, ~bvsub32(free_unsafe_13_~__mptr~4#1.offset, 4bv32); {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} is VALID [2022-02-20 23:51:11,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} SUMMARY for call free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset := read~$Pointer$(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset), 4bv32); srcloc: L771-2 {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} is VALID [2022-02-20 23:51:11,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} free_unsafe_13_~__mptr~5#1.base, free_unsafe_13_~__mptr~5#1.offset := free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;havoc free_unsafe_13_#t~mem40#1.base, free_unsafe_13_#t~mem40#1.offset;free_unsafe_13_~n~1#1.base, free_unsafe_13_~n~1#1.offset := free_unsafe_13_~__mptr~5#1.base, ~bvsub32(free_unsafe_13_~__mptr~5#1.offset, 4bv32); {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} is VALID [2022-02-20 23:51:11,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} assume !!(free_unsafe_13_~p~1#1.base != ~#global_list_13~0.base || ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset) != ~#global_list_13~0.offset); {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} is VALID [2022-02-20 23:51:11,765 INFO L272 TraceCheckUtils]: 29: Hoare triple {10321#(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)) (= (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32))) |ULTIMATE.start_free_unsafe_13_~p~1#1.offset|) (= (_ 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)))) (= |ULTIMATE.start_free_unsafe_13_~p~1#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))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)))} call ldv_list_del(free_unsafe_13_~p~1#1.base, ~bvadd32(4bv32, free_unsafe_13_~p~1#1.offset)); {10334#(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)) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (_ 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$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))))} is VALID [2022-02-20 23:51:11,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {10334#(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)) (= |ldv_list_del_#in~entry#1.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (= (_ 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$.base| (select (select |#memory_$Pointer$.base| (_ bv2 32)) (_ bv0 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))) (_ bv2 32)) (= (bvadd (_ bv4294967292 32) |ldv_list_del_#in~entry#1.offset|) (bvadd (_ bv4294967292 32) (select (select |#memory_$Pointer$.offset| (_ bv2 32)) (_ bv0 32)))))} ~entry#1.base, ~entry#1.offset := #in~entry#1.base, #in~entry#1.offset; {10338#(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|) (= (_ 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$.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:11,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {10338#(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|) (= (_ 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$.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 {10342#(and (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:11,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {10342#(and (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 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 {10342#(and (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))) (= (_ bv2 32) |ldv_list_del_#t~mem16#1.base|))} is VALID [2022-02-20 23:51:11,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {10342#(and (= |ldv_list_del_#t~mem16#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 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; {10349#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))))} is VALID [2022-02-20 23:51:11,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {10349#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 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 {10349#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 32))))} is VALID [2022-02-20 23:51:11,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {10349#(and (= (_ bv2 32) |ldv_list_del___ldv_list_del_~prev#1.base|) (= |ldv_list_del___ldv_list_del_~prev#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| (_ bv2 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)); {10229#false} is VALID [2022-02-20 23:51:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:11,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:11,774 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:11,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705137479] [2022-02-20 23:51:11,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705137479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:11,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:11,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 23:51:11,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272169167] [2022-02-20 23:51:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:11,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:11,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:11,929 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:11,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:51:11,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:51:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:51:11,930 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,549 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-02-20 23:51:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 23:51:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-02-20 23:51:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-02-20 23:51:16,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-02-20 23:51:16,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:16,701 INFO L225 Difference]: With dead ends: 74 [2022-02-20 23:51:16,701 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 23:51:16,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:51:16,701 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 130 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:16,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 130 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 759 Invalid, 0 Unknown, 61 Unchecked, 1.6s Time] [2022-02-20 23:51:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 23:51:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 23:51:16,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:16,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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:51:16,703 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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:51:16,707 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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:51:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,708 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-02-20 23:51:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-02-20 23:51:16,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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 74 states. [2022-02-20 23:51:16,709 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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 74 states. [2022-02-20 23:51:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,709 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-02-20 23:51:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-02-20 23:51:16,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:16,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:16,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:16,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 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:51:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-02-20 23:51:16,710 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 36 [2022-02-20 23:51:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:16,711 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-02-20 23:51:16,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 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:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-02-20 23:51:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:51:16,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:16,711 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, 1, 1, 1, 1, 1] [2022-02-20 23:51:16,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-02-20 23:51:16,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,919 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:51:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash -555084404, now seen corresponding path program 1 times [2022-02-20 23:51:16,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:16,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278743041] [2022-02-20 23:51:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:16,921 INFO L229 MonitoredProcess]: Starting monitored process 27 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:16,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-02-20 23:51:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:17,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core