./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-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_test22_1-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 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:52:00,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:52:00,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:52:00,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:52:00,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:52:00,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:52:00,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:52:00,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:52:00,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:52:00,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:52:00,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:52:00,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:52:00,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:52:00,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:52:00,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:52:00,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:52:00,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:52:00,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:52:00,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:52:00,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:52:00,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:52:00,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:52:00,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:52:00,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:52:00,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:52:00,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:52:00,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:52:00,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:52:00,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:52:00,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:52:00,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:52:00,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:52:00,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:52:00,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:52:00,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:52:00,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:52:00,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:52:00,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:52:00,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:52:00,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:52:00,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:52:00,323 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:52:00,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:52:00,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:52:00,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:52:00,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:52:00,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:52:00,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:52:00,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:52:00,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:52:00,339 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:52:00,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:52:00,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:52:00,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:52:00,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:52:00,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:52:00,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:52:00,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:52:00,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:52:00,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:52:00,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:52:00,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:00,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:52:00,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:52:00,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:52:00,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:52:00,342 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 -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2022-02-20 23:52:00,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:52:00,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:52:00,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:52:00,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:52:00,547 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:52:00,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-02-20 23:52:00,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e716083/19f6a84a0bc7404ab912db59afedc681/FLAGef655a8c6 [2022-02-20 23:52:00,986 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:52:00,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-02-20 23:52:01,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e716083/19f6a84a0bc7404ab912db59afedc681/FLAGef655a8c6 [2022-02-20 23:52:01,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e716083/19f6a84a0bc7404ab912db59afedc681 [2022-02-20 23:52:01,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:52:01,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:52:01,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:01,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:52:01,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:52:01,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:01" (1/1) ... [2022-02-20 23:52:01,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260bb4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:01, skipping insertion in model container [2022-02-20 23:52:01,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:01" (1/1) ... [2022-02-20 23:52:01,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:52:01,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:01,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:01,789 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:52:01,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4af23f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:01, skipping insertion in model container [2022-02-20 23:52:01,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:01,790 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:52:01,792 INFO L158 Benchmark]: Toolchain (without parser) took 411.69ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 66.3MB in the end (delta: -7.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:52:01,793 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 75.5MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:52:01,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.73ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 66.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:52:01,795 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 75.5MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.73ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 66.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-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 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:52:03,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:52:03,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:52:03,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:52:03,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:52:03,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:52:03,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:52:03,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:52:03,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:52:03,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:52:03,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:52:03,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:52:03,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:52:03,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:52:03,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:52:03,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:52:03,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:52:03,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:52:03,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:52:03,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:52:03,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:52:03,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:52:03,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:52:03,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:52:03,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:52:03,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:52:03,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:52:03,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:52:03,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:52:03,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:52:03,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:52:03,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:52:03,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:52:03,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:52:03,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:52:03,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:52:03,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:52:03,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:52:03,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:52:03,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:52:03,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:52:03,290 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:52:03,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:52:03,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:52:03,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:52:03,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:52:03,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:52:03,322 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:52:03,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:52:03,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:52:03,323 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:52:03,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:52:03,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:52:03,324 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:52:03,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:52:03,325 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:52:03,326 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:52:03,326 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:52:03,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:52:03,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:52:03,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:52:03,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:52:03,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:52:03,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:03,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:52:03,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:52:03,327 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:52:03,327 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:52:03,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:52:03,328 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 -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2022-02-20 23:52:03,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:52:03,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:52:03,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:52:03,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:52:03,610 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:52:03,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-02-20 23:52:03,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a660bd/95a09c771c504998971c2358922aa6cf/FLAGc599fe354 [2022-02-20 23:52:04,111 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:52:04,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-02-20 23:52:04,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a660bd/95a09c771c504998971c2358922aa6cf/FLAGc599fe354 [2022-02-20 23:52:04,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a660bd/95a09c771c504998971c2358922aa6cf [2022-02-20 23:52:04,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:52:04,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:52:04,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:04,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:52:04,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:52:04,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc87643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04, skipping insertion in model container [2022-02-20 23:52:04,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:52:04,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:04,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:04,548 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:52:04,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:04,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:04,598 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:52:04,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:04,687 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:52:04,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04 WrapperNode [2022-02-20 23:52:04,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:04,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:52:04,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:52:04,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:52:04,693 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:52:04" (1/1) ... [2022-02-20 23:52:04,722 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:52:04" (1/1) ... [2022-02-20 23:52:04,740 INFO L137 Inliner]: procedures = 165, calls = 69, calls flagged for inlining = 23, calls inlined = 15, statements flattened = 99 [2022-02-20 23:52:04,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:52:04,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:52:04,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:52:04,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:52:04,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:52:04,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:52:04,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:52:04,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:52:04,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (1/1) ... [2022-02-20 23:52:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:52:04,802 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:52:04,811 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:52:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:52:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:52:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-02-20 23:52:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:52:04,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:52:04,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:52:04,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:52:04,989 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:52:04,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:52:05,287 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:52:05,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:52:05,295 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:52:05,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:52:05 BoogieIcfgContainer [2022-02-20 23:52:05,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:52:05,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:52:05,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:52:05,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:52:05,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:52:04" (1/3) ... [2022-02-20 23:52:05,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cc26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:52:05, skipping insertion in model container [2022-02-20 23:52:05,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:04" (2/3) ... [2022-02-20 23:52:05,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cc26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:52:05, skipping insertion in model container [2022-02-20 23:52:05,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:52:05" (3/3) ... [2022-02-20 23:52:05,302 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-2.i [2022-02-20 23:52:05,306 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:52:05,306 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-02-20 23:52:05,338 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:52:05,343 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:52:05,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-20 23:52:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:52:05,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:05,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:05,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash -668549309, now seen corresponding path program 1 times [2022-02-20 23:52:05,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:05,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054165770] [2022-02-20 23:52:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:05,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:05,376 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:52:05,382 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:52:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:05,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:52:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:05,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:05,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:05,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#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); {76#true} is VALID [2022-02-20 23:52:05,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {76#true} is VALID [2022-02-20 23:52:05,688 INFO L272 TraceCheckUtils]: 2: Hoare triple {76#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {76#true} is VALID [2022-02-20 23:52:05,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {76#true} ~size := #in~size; {76#true} is VALID [2022-02-20 23:52:05,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {76#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; {93#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:05,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {93#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:05,696 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {93#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {76#true} #119#return; {100#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:05,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {104#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:05,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {108#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:05,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {77#false} is VALID [2022-02-20 23:52:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:05,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:05,705 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:05,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054165770] [2022-02-20 23:52:05,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054165770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:05,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:05,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:05,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792166241] [2022-02-20 23:52:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-02-20 23:52:05,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:05,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:05,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:05,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:52:05,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:52:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:52:05,746 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:06,747 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2022-02-20 23:52:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-02-20 23:52:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2022-02-20 23:52:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2022-02-20 23:52:06,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 197 transitions. [2022-02-20 23:52:06,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:06,966 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:52:06,966 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:52:06,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:06,970 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 139 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:06,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 320 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:52:06,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:52:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 76. [2022-02-20 23:52:07,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:07,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,005 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,005 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:07,013 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2022-02-20 23:52:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2022-02-20 23:52:07,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:07,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:07,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 173 states. [2022-02-20 23:52:07,015 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 173 states. [2022-02-20 23:52:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:07,022 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2022-02-20 23:52:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2022-02-20 23:52:07,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:07,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:07,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:07,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-02-20 23:52:07,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 10 [2022-02-20 23:52:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:07,027 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-02-20 23:52:07,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-02-20 23:52:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:52:07,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:07,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:07,045 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:52:07,231 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:52:07,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -639920158, now seen corresponding path program 1 times [2022-02-20 23:52:07,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:07,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109831413] [2022-02-20 23:52:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:07,235 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:52:07,236 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:52:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:07,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:52:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:07,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:07,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {716#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); {716#true} is VALID [2022-02-20 23:52:07,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {716#true} is VALID [2022-02-20 23:52:07,404 INFO L272 TraceCheckUtils]: 2: Hoare triple {716#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {716#true} is VALID [2022-02-20 23:52:07,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {716#true} ~size := #in~size; {716#true} is VALID [2022-02-20 23:52:07,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {716#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {733#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:07,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {733#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:07,405 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {733#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {716#true} #119#return; {740#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:07,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {740#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {744#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:07,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {744#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {717#false} is VALID [2022-02-20 23:52:07,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#false} assume !(1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {717#false} is VALID [2022-02-20 23:52:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:07,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:07,407 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:07,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109831413] [2022-02-20 23:52:07,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109831413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:07,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:07,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:07,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257007666] [2022-02-20 23:52:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:07,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2022-02-20 23:52:07,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:07,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:07,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:52:07,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:52:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:07,418 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:07,760 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-02-20 23:52:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:52:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2022-02-20 23:52:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:52:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:52:07,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 122 transitions. [2022-02-20 23:52:07,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:07,855 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:52:07,856 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:52:07,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:07,856 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:07,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 304 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:52:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2022-02-20 23:52:07,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:07,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,860 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,861 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:07,863 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-02-20 23:52:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-02-20 23:52:07,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:07,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:07,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 112 states. [2022-02-20 23:52:07,864 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 112 states. [2022-02-20 23:52:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:07,867 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-02-20 23:52:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-02-20 23:52:07,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:07,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:07,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:07,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-02-20 23:52:07,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2022-02-20 23:52:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:07,869 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-02-20 23:52:07,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-02-20 23:52:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:52:07,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:07,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:07,880 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:52:08,070 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:52:08,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 749807950, now seen corresponding path program 1 times [2022-02-20 23:52:08,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:08,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517515604] [2022-02-20 23:52:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:08,073 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:52:08,075 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:52:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:08,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:52:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:08,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:08,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:08,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {1160#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); {1160#true} is VALID [2022-02-20 23:52:08,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {1160#true} is VALID [2022-02-20 23:52:08,253 INFO L272 TraceCheckUtils]: 2: Hoare triple {1160#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {1160#true} is VALID [2022-02-20 23:52:08,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {1160#true} ~size := #in~size; {1174#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:08,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {1174#(= 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; {1178#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:08,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1178#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:08,256 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1178#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1160#true} #119#return; {1185#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} is VALID [2022-02-20 23:52:08,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1185#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {1189#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:08,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {1193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} is VALID [2022-02-20 23:52:08,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} is VALID [2022-02-20 23:52:08,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {1193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} assume !((~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset)); {1161#false} is VALID [2022-02-20 23:52:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:08,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:08,261 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:08,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517515604] [2022-02-20 23:52:08,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517515604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:08,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:08,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:52:08,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890658447] [2022-02-20 23:52:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:52:08,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:08,267 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), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:08,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:08,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:52:08,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:52:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:08,277 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:09,266 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-02-20 23:52:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:52:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-02-20 23:52:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-02-20 23:52:09,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 161 transitions. [2022-02-20 23:52:09,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:09,414 INFO L225 Difference]: With dead ends: 149 [2022-02-20 23:52:09,414 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:52:09,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:09,415 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 115 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:09,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 427 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:52:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:52:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2022-02-20 23:52:09,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:09,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:09,420 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:09,420 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:09,423 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-02-20 23:52:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-02-20 23:52:09,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:09,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:09,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 149 states. [2022-02-20 23:52:09,424 INFO L87 Difference]: Start difference. First operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 149 states. [2022-02-20 23:52:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:09,427 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-02-20 23:52:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-02-20 23:52:09,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:09,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:09,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:09,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-02-20 23:52:09,430 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 11 [2022-02-20 23:52:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:09,430 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-02-20 23:52:09,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-02-20 23:52:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:52:09,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:09,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:09,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:52:09,643 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:52:09,644 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1769183241, now seen corresponding path program 1 times [2022-02-20 23:52:09,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:09,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863679475] [2022-02-20 23:52:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:09,646 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:52:09,647 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:52:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:09,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:52:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:09,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:09,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {1723#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); {1723#true} is VALID [2022-02-20 23:52:09,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {1723#true} is VALID [2022-02-20 23:52:09,739 INFO L272 TraceCheckUtils]: 2: Hoare triple {1723#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {1723#true} is VALID [2022-02-20 23:52:09,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {1723#true} ~size := #in~size; {1723#true} is VALID [2022-02-20 23:52:09,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {1723#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; {1740#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:09,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1740#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:09,740 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1740#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {1723#true} #119#return; {1747#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:09,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1747#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {1751#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:09,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1751#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := 0bv32, 0bv32; {1724#false} is VALID [2022-02-20 23:52:09,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {1724#false} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {1724#false} is VALID [2022-02-20 23:52:09,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {1724#false} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {1724#false} is VALID [2022-02-20 23:52:09,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {1724#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {1724#false} is VALID [2022-02-20 23:52:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:09,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:09,742 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:09,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863679475] [2022-02-20 23:52:09,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863679475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:09,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:09,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:09,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196070830] [2022-02-20 23:52:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:09,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:09,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:09,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:09,753 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:52:09,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:52:09,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:09,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:52:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:09,754 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,105 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-02-20 23:52:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:52:10,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-02-20 23:52:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-02-20 23:52:10,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 120 transitions. [2022-02-20 23:52:10,206 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:52:10,208 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:52:10,208 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 23:52:10,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:10,209 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 56 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:10,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 23:52:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-02-20 23:52:10,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:10,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,212 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,212 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,215 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-02-20 23:52:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-02-20 23:52:10,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:10,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:10,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 111 states. [2022-02-20 23:52:10,216 INFO L87 Difference]: Start difference. First operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 111 states. [2022-02-20 23:52:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,219 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-02-20 23:52:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-02-20 23:52:10,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:10,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:10,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:10,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-02-20 23:52:10,221 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 12 [2022-02-20 23:52:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:10,221 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-02-20 23:52:10,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-02-20 23:52:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:52:10,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:10,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:10,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:10,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:10,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash -782973720, now seen corresponding path program 1 times [2022-02-20 23:52:10,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:10,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926634463] [2022-02-20 23:52:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:10,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:10,424 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:10,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:52:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:10,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:52:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:10,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:10,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#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); {2169#true} is VALID [2022-02-20 23:52:10,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {2169#true} is VALID [2022-02-20 23:52:10,538 INFO L272 TraceCheckUtils]: 2: Hoare triple {2169#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {2169#true} is VALID [2022-02-20 23:52:10,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {2169#true} ~size := #in~size; {2169#true} is VALID [2022-02-20 23:52:10,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {2169#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2169#true} is VALID [2022-02-20 23:52:10,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 23:52:10,539 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2169#true} {2169#true} #119#return; {2169#true} is VALID [2022-02-20 23:52:10,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2169#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {2169#true} is VALID [2022-02-20 23:52:10,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {2169#true} assume ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := 0bv32, 0bv32; {2198#(and (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:10,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {2198#(and (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {2202#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:10,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {2202#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {2170#false} is VALID [2022-02-20 23:52:10,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {2170#false} is VALID [2022-02-20 23:52:10,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:52:10,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:10,543 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:10,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926634463] [2022-02-20 23:52:10,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926634463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:10,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:10,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:52:10,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704068960] [2022-02-20 23:52:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:10,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:10,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:10,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,556 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:52:10,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:52:10,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:52:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:10,557 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,775 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:52:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-02-20 23:52:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-02-20 23:52:10,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-02-20 23:52:10,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:10,848 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:52:10,848 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:52:10,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:52:10,849 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:10,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 219 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:52:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2022-02-20 23:52:10,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:10,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,852 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,852 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,853 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:52:10,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:10,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:10,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 83 states. [2022-02-20 23:52:10,854 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Second operand 83 states. [2022-02-20 23:52:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:10,857 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:52:10,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:10,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:10,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:10,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-02-20 23:52:10,859 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 12 [2022-02-20 23:52:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:10,859 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-02-20 23:52:10,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 23:52:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:52:10,859 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:10,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:10,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:11,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:11,066 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -816988662, now seen corresponding path program 1 times [2022-02-20 23:52:11,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:11,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280137372] [2022-02-20 23:52:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:11,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:52:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:11,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:52:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:11,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:11,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {2534#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); {2534#true} is VALID [2022-02-20 23:52:11,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {2534#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,170 INFO L272 TraceCheckUtils]: 2: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {2546#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:11,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#(= |old(#valid)| |#valid|)} ~size := #in~size; {2546#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:11,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2546#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:11,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#(= |old(#valid)| |#valid|)} assume true; {2546#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:11,172 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2546#(= |old(#valid)| |#valid|)} {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #119#return; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := 0bv32, 0bv32; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32); {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_ldv_kobject_put } true; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:11,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {2542#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {2535#false} is VALID [2022-02-20 23:52:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:11,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:11,175 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:11,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280137372] [2022-02-20 23:52:11,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280137372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:11,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:11,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:52:11,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133897137] [2022-02-20 23:52:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:52:11,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:11,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:11,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:52:11,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:52:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:11,186 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:11,452 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-02-20 23:52:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:52:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:52:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-02-20 23:52:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-02-20 23:52:11,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-02-20 23:52:11,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:11,526 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:52:11,527 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 23:52:11,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:11,527 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:11,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:52:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 23:52:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-20 23:52:11,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:11,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:11,530 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:11,530 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:11,532 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-02-20 23:52:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-02-20 23:52:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:11,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 23:52:11,533 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 23:52:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:11,534 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-02-20 23:52:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-02-20 23:52:11,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:11,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:11,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:11,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-02-20 23:52:11,536 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 14 [2022-02-20 23:52:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:11,536 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-02-20 23:52:11,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-02-20 23:52:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:52:11,537 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:11,537 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:52:11,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:11,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:11,746 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1730388367, now seen corresponding path program 1 times [2022-02-20 23:52:11,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:11,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793548452] [2022-02-20 23:52:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:11,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:11,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:11,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:52:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:11,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:52:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:11,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:11,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {2864#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); {2864#true} is VALID [2022-02-20 23:52:11,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {2864#true} is VALID [2022-02-20 23:52:11,844 INFO L272 TraceCheckUtils]: 2: Hoare triple {2864#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {2864#true} is VALID [2022-02-20 23:52:11,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {2864#true} ~size := #in~size; {2864#true} is VALID [2022-02-20 23:52:11,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {2864#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; {2864#true} is VALID [2022-02-20 23:52:11,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-02-20 23:52:11,845 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2864#true} {2864#true} #119#return; {2864#true} is VALID [2022-02-20 23:52:11,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {2864#true} is VALID [2022-02-20 23:52:11,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {2893#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:11,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {2893#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2893#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:11,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {2893#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {2900#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:11,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {2865#false} is VALID [2022-02-20 23:52:11,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {2865#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {2865#false} is VALID [2022-02-20 23:52:11,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {2865#false} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {2865#false} is VALID [2022-02-20 23:52:11,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {2865#false} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {2865#false} is VALID [2022-02-20 23:52:11,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {2865#false} assume !(1bv1 == #valid[ldv_kref_init_~kref#1.base]); {2865#false} is VALID [2022-02-20 23:52:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:11,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:11,848 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:11,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793548452] [2022-02-20 23:52:11,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793548452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:11,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:11,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:52:11,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141432690] [2022-02-20 23:52:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:52:11,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:11,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:11,862 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:52:11,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:52:11,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:11,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:52:11,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:11,863 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,031 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-02-20 23:52:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:52:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:52:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 23:52:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 23:52:12,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-02-20 23:52:12,095 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:52:12,096 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:52:12,096 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:52:12,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:12,097 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:12,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 157 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:52:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-20 23:52:12,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:12,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,099 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,102 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,103 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-02-20 23:52:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-02-20 23:52:12,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:12,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:12,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 23:52:12,104 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 23:52:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,105 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-02-20 23:52:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-02-20 23:52:12,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:12,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:12,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:12,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-02-20 23:52:12,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 16 [2022-02-20 23:52:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:12,107 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-02-20 23:52:12,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-02-20 23:52:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:52:12,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:12,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:12,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:12,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:12,317 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:12,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2133276344, now seen corresponding path program 1 times [2022-02-20 23:52:12,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:12,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913460403] [2022-02-20 23:52:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:12,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:12,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:52:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:12,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:52:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:12,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:12,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {3195#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); {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L272 TraceCheckUtils]: 2: Hoare triple {3195#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {3195#true} ~size := #in~size; {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {3195#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; {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-02-20 23:52:12,434 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3195#true} {3195#true} #119#return; {3195#true} is VALID [2022-02-20 23:52:12,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {3195#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {3195#true} is VALID [2022-02-20 23:52:12,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {3224#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {3224#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3224#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {3224#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {3231#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:12,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {3231#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3235#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:12,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {3235#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {3196#false} is VALID [2022-02-20 23:52:12,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {3196#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#false} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#false} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {3196#false} assume !(1bv1 == #valid[ldv_kref_init_~kref#1.base]); {3196#false} is VALID [2022-02-20 23:52:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:12,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:12,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {3196#false} assume !(1bv1 == #valid[ldv_kref_init_~kref#1.base]); {3196#false} is VALID [2022-02-20 23:52:12,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#false} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#false} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {3196#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {3196#false} is VALID [2022-02-20 23:52:12,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {3263#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {3196#false} is VALID [2022-02-20 23:52:12,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {3267#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3263#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {3271#(bvult (_ bv1 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {3267#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {3271#(bvult (_ bv1 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3271#(bvult (_ bv1 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {3271#(bvult (_ bv1 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:12,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {3195#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {3195#true} is VALID [2022-02-20 23:52:12,538 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3195#true} {3195#true} #119#return; {3195#true} is VALID [2022-02-20 23:52:12,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {3195#true} assume true; {3195#true} is VALID [2022-02-20 23:52:12,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {3195#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; {3195#true} is VALID [2022-02-20 23:52:12,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {3195#true} ~size := #in~size; {3195#true} is VALID [2022-02-20 23:52:12,539 INFO L272 TraceCheckUtils]: 2: Hoare triple {3195#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {3195#true} is VALID [2022-02-20 23:52:12,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {3195#true} is VALID [2022-02-20 23:52:12,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {3195#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); {3195#true} is VALID [2022-02-20 23:52:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:12,539 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:12,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913460403] [2022-02-20 23:52:12,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913460403] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:52:12,539 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:12,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 23:52:12,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247699961] [2022-02-20 23:52:12,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:52:12,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:12,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:12,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:52:12,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:52:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:52:12,572 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,887 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-02-20 23:52:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:52:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-02-20 23:52:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-02-20 23:52:12,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-02-20 23:52:12,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:12,966 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:52:12,966 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:52:12,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:52:12,966 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:12,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 243 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:52:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 23:52:12,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:12,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,969 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,969 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,970 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-02-20 23:52:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 23:52:12,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:12,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:12,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-02-20 23:52:12,971 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-02-20 23:52:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:12,980 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-02-20 23:52:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 23:52:12,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:12,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:12,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:12,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-02-20 23:52:12,981 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 17 [2022-02-20 23:52:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:12,981 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-02-20 23:52:12,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 23:52:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:52:12,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:12,982 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:12,994 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:52:13,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:13,195 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1089714225, now seen corresponding path program 2 times [2022-02-20 23:52:13,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:13,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015370043] [2022-02-20 23:52:13,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:52:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:13,196 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:52:13,197 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:52:13,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:52:13,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:52:13,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:52:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:13,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:13,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:13,362 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); {3597#true} is VALID [2022-02-20 23:52:13,365 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;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {3597#true} is VALID [2022-02-20 23:52:13,365 INFO L272 TraceCheckUtils]: 2: Hoare triple {3597#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {3597#true} is VALID [2022-02-20 23:52:13,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {3597#true} ~size := #in~size; {3597#true} is VALID [2022-02-20 23:52:13,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {3597#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; {3614#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:13,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {3614#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {3614#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:13,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3614#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {3597#true} #119#return; {3621#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {3621#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {3625#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {3653#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {3653#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {3657#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {3657#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {3661#(= (select |#valid| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:13,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {3661#(= (select |#valid| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[ldv_kref_init_~kref#1.base]); {3598#false} is VALID [2022-02-20 23:52:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:52:13,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:13,383 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:13,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015370043] [2022-02-20 23:52:13,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015370043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:13,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:13,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:52:13,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287809825] [2022-02-20 23:52:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:52:13,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:13,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:13,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:13,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:52:13,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:13,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:52:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:52:13,401 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:14,372 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-20 23:52:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:52:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 23:52:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-02-20 23:52:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2022-02-20 23:52:14,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 140 transitions. [2022-02-20 23:52:14,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:14,507 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:52:14,507 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 23:52:14,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:14,508 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 143 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:14,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 393 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:52:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 23:52:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 72. [2022-02-20 23:52:14,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:14,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:14,510 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:14,510 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:14,512 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-20 23:52:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-02-20 23:52:14,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:14,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:14,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 137 states. [2022-02-20 23:52:14,513 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 137 states. [2022-02-20 23:52:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:14,515 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-20 23:52:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-02-20 23:52:14,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:14,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:14,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:14,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-02-20 23:52:14,517 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 20 [2022-02-20 23:52:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:14,517 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-02-20 23:52:14,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-02-20 23:52:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:52:14,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:14,518 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:14,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 23:52:14,724 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:52:14,724 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1089714226, now seen corresponding path program 1 times [2022-02-20 23:52:14,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:14,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131063840] [2022-02-20 23:52:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:14,726 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:52:14,727 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:52:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:14,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:52:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:14,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:14,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {4153#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); {4153#true} is VALID [2022-02-20 23:52:14,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {4153#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L272 TraceCheckUtils]: 2: Hoare triple {4153#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {4153#true} ~size := #in~size; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {4153#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; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {4153#true} assume true; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4153#true} {4153#true} #119#return; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {4153#true} is VALID [2022-02-20 23:52:14,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {4182#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:14,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {4182#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4182#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:14,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {4182#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {4189#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:14,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {4189#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:14,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {4193#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4197#(and (= (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:14,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {4197#(and (= (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4201#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} is VALID [2022-02-20 23:52:14,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {4201#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4205#(and (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:14,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {4205#(and (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {4154#false} is VALID [2022-02-20 23:52:14,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {4154#false} is VALID [2022-02-20 23:52:14,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {4154#false} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {4154#false} is VALID [2022-02-20 23:52:14,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {4154#false} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {4154#false} is VALID [2022-02-20 23:52:14,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {4154#false} assume !((~bvule32(~bvadd32(4bv32, ldv_kref_init_~kref#1.offset), #length[ldv_kref_init_~kref#1.base]) && ~bvule32(ldv_kref_init_~kref#1.offset, ~bvadd32(4bv32, ldv_kref_init_~kref#1.offset))) && ~bvule32(0bv32, ldv_kref_init_~kref#1.offset)); {4154#false} is VALID [2022-02-20 23:52:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:14,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:15,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {4154#false} assume !((~bvule32(~bvadd32(4bv32, ldv_kref_init_~kref#1.offset), #length[ldv_kref_init_~kref#1.base]) && ~bvule32(ldv_kref_init_~kref#1.offset, ~bvadd32(4bv32, ldv_kref_init_~kref#1.offset))) && ~bvule32(0bv32, ldv_kref_init_~kref#1.offset)); {4154#false} is VALID [2022-02-20 23:52:15,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {4154#false} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {4154#false} is VALID [2022-02-20 23:52:15,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {4154#false} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {4154#false} is VALID [2022-02-20 23:52:15,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {4154#false} is VALID [2022-02-20 23:52:15,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {4154#false} is VALID [2022-02-20 23:52:15,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {4237#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4233#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {4241#(bvult (bvadd (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4237#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {4245#(bvult (bvadd (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4241#(bvult (bvadd (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {4249#(bvult (bvadd (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4245#(bvult (bvadd (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {4253#(bvult (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {4249#(bvult (bvadd (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {4253#(bvult (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4253#(bvult (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {4253#(bvult (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:15,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {4153#true} is VALID [2022-02-20 23:52:15,164 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4153#true} {4153#true} #119#return; {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {4153#true} assume true; {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {4153#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; {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {4153#true} ~size := #in~size; {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L272 TraceCheckUtils]: 2: Hoare triple {4153#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {4153#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {4153#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); {4153#true} is VALID [2022-02-20 23:52:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:15,165 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:15,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131063840] [2022-02-20 23:52:15,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131063840] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:52:15,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:15,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-20 23:52:15,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611886694] [2022-02-20 23:52:15,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:15,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2022-02-20 23:52:15,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:15,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:15,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:15,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:52:15,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:52:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:52:15,284 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:16,021 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-02-20 23:52:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:52:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2022-02-20 23:52:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-02-20 23:52:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-02-20 23:52:16,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 89 transitions. [2022-02-20 23:52:16,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:16,121 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:52:16,121 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:52:16,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:52:16,121 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 106 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:16,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 427 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:52:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:52:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-20 23:52:16,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:16,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:16,124 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:16,124 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:16,125 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-02-20 23:52:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-02-20 23:52:16,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:16,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:16,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 23:52:16,126 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 78 states. [2022-02-20 23:52:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:16,132 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-02-20 23:52:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-02-20 23:52:16,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:16,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:16,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:16,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-02-20 23:52:16,134 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 20 [2022-02-20 23:52:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:16,134 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-02-20 23:52:16,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-02-20 23:52:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:52:16,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:16,134 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:16,143 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:52:16,345 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:52:16,345 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 335305426, now seen corresponding path program 2 times [2022-02-20 23:52:16,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:16,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392097019] [2022-02-20 23:52:16,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:52:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:16,347 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:52:16,348 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:52:16,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:52:16,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:52:16,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:52:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:16,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:16,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:16,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {4605#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); {4605#true} is VALID [2022-02-20 23:52:16,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {4605#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {4605#true} is VALID [2022-02-20 23:52:16,675 INFO L272 TraceCheckUtils]: 2: Hoare triple {4605#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {4605#true} is VALID [2022-02-20 23:52:16,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {4605#true} ~size := #in~size; {4619#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:16,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {4619#(= 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; {4623#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:16,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {4623#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {4623#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:16,679 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4623#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {4605#true} #119#return; {4630#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} is VALID [2022-02-20 23:52:16,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {4630#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:16,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {4634#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {4680#(and (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|)))} is VALID [2022-02-20 23:52:16,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {4680#(and (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {4684#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} is VALID [2022-02-20 23:52:16,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {4684#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {4688#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kref_init_~kref#1.base|)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:52:16,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {4688#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kref_init_~kref#1.base|)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ldv_kref_init_~kref#1.offset), #length[ldv_kref_init_~kref#1.base]) && ~bvule32(ldv_kref_init_~kref#1.offset, ~bvadd32(4bv32, ldv_kref_init_~kref#1.offset))) && ~bvule32(0bv32, ldv_kref_init_~kref#1.offset)); {4606#false} is VALID [2022-02-20 23:52:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-20 23:52:16,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:16,693 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:16,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392097019] [2022-02-20 23:52:16,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392097019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:16,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:16,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:52:16,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093850421] [2022-02-20 23:52:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:52:16,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:16,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:16,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:16,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:52:16,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:16,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:52:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:16,712 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:18,243 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-02-20 23:52:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:52:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:52:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-02-20 23:52:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-02-20 23:52:18,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 156 transitions. [2022-02-20 23:52:18,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:18,423 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:52:18,423 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:52:18,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:52:18,424 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 189 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:18,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 614 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:52:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:52:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 77. [2022-02-20 23:52:18,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:18,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:18,435 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:18,436 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:18,438 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-02-20 23:52:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2022-02-20 23:52:18,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:18,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:18,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 156 states. [2022-02-20 23:52:18,439 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 156 states. [2022-02-20 23:52:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:18,441 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-02-20 23:52:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2022-02-20 23:52:18,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:18,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:18,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:18,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-02-20 23:52:18,442 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-02-20 23:52:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:18,443 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-02-20 23:52:18,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-02-20 23:52:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:52:18,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:18,445 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:18,453 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:52:18,653 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:52:18,654 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 104459153, now seen corresponding path program 1 times [2022-02-20 23:52:18,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:18,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440100210] [2022-02-20 23:52:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:18,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:18,656 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:52:18,657 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:52:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:18,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:52:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:18,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {5244#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); {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {5244#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L272 TraceCheckUtils]: 2: Hoare triple {5244#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {5244#true} ~size := #in~size; {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {5244#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; {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {5244#true} assume true; {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5244#true} {5244#true} #119#return; {5244#true} is VALID [2022-02-20 23:52:18,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {5244#true} is VALID [2022-02-20 23:52:18,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {5244#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {5273#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:18,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {5273#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5273#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:18,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {5273#(= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {5280#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {5280#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5284#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:18,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {5284#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5288#(and (= (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {5288#(and (= (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5292#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} is VALID [2022-02-20 23:52:18,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5296#(and (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {5296#(and (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5300#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} is VALID [2022-02-20 23:52:18,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {5300#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5304#(and (= (_ bv4 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {5304#(and (= (_ bv4 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5308#(and (= (_ bv7 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#(and (= (_ bv7 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5312#(and (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {5312#(and (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5316#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)))} is VALID [2022-02-20 23:52:18,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {5316#(and (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5320#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {5320#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= (_ bv16 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {5245#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {5245#false} assume ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32; {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {5245#false} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {5245#false} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {5245#false} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {5245#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {5245#false} is VALID [2022-02-20 23:52:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:18,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {5245#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {5245#false} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {5245#false} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {5245#false} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5245#false} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {5245#false} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {5245#false} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5245#false} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {5245#false} assume ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32; {5245#false} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {5245#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {5245#false} is VALID [2022-02-20 23:52:19,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {5360#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {5245#false} is VALID [2022-02-20 23:52:19,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {5364#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5360#(bvult |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {5368#(bvult (bvadd (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5364#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv1 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(bvult (bvadd (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5368#(bvult (bvadd (_ bv2 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {5376#(bvult (bvadd (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5372#(bvult (bvadd (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {5380#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv5 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5376#(bvult (bvadd (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {5384#(bvult (bvadd (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5380#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv5 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {5388#(bvult (bvadd (_ bv7 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5384#(bvult (bvadd (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {5392#(bvult (bvadd (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5388#(bvult (bvadd (_ bv7 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {5396#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5392#(bvult (bvadd (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {5400#(bvult (bvadd (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5396#(bvult (bvadd |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {5404#(bvult (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {5400#(bvult (bvadd (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {5404#(bvult (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5404#(bvult (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {5244#true} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {5404#(bvult (_ bv10 32) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#true} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5244#true} {5244#true} #119#return; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {5244#true} assume true; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {5244#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; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {5244#true} ~size := #in~size; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L272 TraceCheckUtils]: 2: Hoare triple {5244#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {5244#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {5244#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); {5244#true} is VALID [2022-02-20 23:52:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:19,638 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:19,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440100210] [2022-02-20 23:52:19,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440100210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:52:19,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:19,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-02-20 23:52:19,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79375171] [2022-02-20 23:52:19,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2022-02-20 23:52:19,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:19,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:19,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:19,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 23:52:19,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 23:52:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-02-20 23:52:19,887 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:21,398 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-02-20 23:52:21,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:52:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2022-02-20 23:52:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-02-20 23:52:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-02-20 23:52:21,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 94 transitions. [2022-02-20 23:52:21,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:21,524 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:52:21,524 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:52:21,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-02-20 23:52:21,525 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 52 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:21,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 840 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:52:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:52:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-20 23:52:21,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:21,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:21,527 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:21,527 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:21,528 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-02-20 23:52:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-02-20 23:52:21,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:21,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:21,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:52:21,529 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:52:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:21,530 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-02-20 23:52:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-02-20 23:52:21,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:21,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:21,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:21,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-02-20 23:52:21,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 28 [2022-02-20 23:52:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:21,532 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-02-20 23:52:21,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-02-20 23:52:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:52:21,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:21,535 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:21,542 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:52:21,742 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:52:21,742 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1246096945, now seen corresponding path program 2 times [2022-02-20 23:52:21,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:21,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619338127] [2022-02-20 23:52:21,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:52:21,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:21,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:21,744 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:52:21,745 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:52:21,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:52:21,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:52:21,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:52:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:21,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:21,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {5776#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); {5776#true} is VALID [2022-02-20 23:52:21,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5776#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5776#true} is VALID [2022-02-20 23:52:21,923 INFO L272 TraceCheckUtils]: 2: Hoare triple {5776#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {5776#true} is VALID [2022-02-20 23:52:21,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {5776#true} ~size := #in~size; {5776#true} is VALID [2022-02-20 23:52:21,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {5776#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; {5793#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {5793#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,925 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5793#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {5776#true} #119#return; {5800#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {5800#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {5804#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {5868#(not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {5868#(not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| (_ bv0 32)))} assume ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32; {5777#false} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {5777#false} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {5777#false} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {5777#false} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {5777#false} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {5777#false} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {5777#false} is VALID [2022-02-20 23:52:21,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {5777#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {5777#false} is VALID [2022-02-20 23:52:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:21,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:21,934 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:21,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619338127] [2022-02-20 23:52:21,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619338127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:21,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:21,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:52:21,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838315277] [2022-02-20 23:52:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:52:21,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:21,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:21,956 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:52:21,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:52:21,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:52:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:52:21,957 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:22,243 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:52:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:52:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-20 23:52:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-02-20 23:52:22,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-02-20 23:52:22,303 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:52:22,304 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:52:22,304 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:52:22,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:22,305 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:22,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 229 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:52:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-20 23:52:22,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:22,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:22,307 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:22,307 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:22,308 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:52:22,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:22,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:22,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:52:22,309 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 83 states. [2022-02-20 23:52:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:22,310 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:52:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:52:22,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:22,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:22,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:22,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-02-20 23:52:22,311 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 34 [2022-02-20 23:52:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:22,311 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-02-20 23:52:22,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:52:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:52:22,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:22,312 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:22,319 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:52:22,519 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:52:22,519 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash 652031296, now seen corresponding path program 1 times [2022-02-20 23:52:22,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:22,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362818960] [2022-02-20 23:52:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:22,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:22,521 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:52:22,522 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:52:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:22,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:52:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:22,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:22,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:22,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {6217#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); {6217#true} is VALID [2022-02-20 23:52:22,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {6217#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {6217#true} is VALID [2022-02-20 23:52:22,817 INFO L272 TraceCheckUtils]: 2: Hoare triple {6217#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {6217#true} is VALID [2022-02-20 23:52:22,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {6217#true} ~size := #in~size; {6217#true} is VALID [2022-02-20 23:52:22,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {6217#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; {6234#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:22,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {6234#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {6234#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:22,819 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6234#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {6217#true} #119#return; {6241#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6241#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {6309#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {6309#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kref_init } true; {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,828 INFO L272 TraceCheckUtils]: 33: Hoare triple {6313#(= (select |#valid| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (_ bv1 1))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {6326#(= (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:22,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {6326#(= (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|) (_ bv1 1))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {6330#(= (select |#valid| LDV_INIT_LIST_HEAD_~list.base) (_ bv1 1))} is VALID [2022-02-20 23:52:22,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {6330#(= (select |#valid| LDV_INIT_LIST_HEAD_~list.base) (_ bv1 1))} assume !(1bv1 == #valid[~list.base]); {6218#false} is VALID [2022-02-20 23:52:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:22,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:22,829 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:22,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362818960] [2022-02-20 23:52:22,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362818960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:22,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:22,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:52:22,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660584992] [2022-02-20 23:52:22,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 36 [2022-02-20 23:52:22,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:22,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:52:22,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:22,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:52:22,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:22,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:52:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:22,849 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:52:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:23,534 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:52:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:52:23,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 36 [2022-02-20 23:52:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:52:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 23:52:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:52:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 23:52:23,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-02-20 23:52:23,596 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:52:23,597 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:52:23,597 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:52:23,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:52:23,597 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:23,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 244 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:52:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:52:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-02-20 23:52:23,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:23,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:23,599 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:23,600 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:23,600 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:52:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:52:23,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:23,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:23,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 23:52:23,601 INFO L87 Difference]: Start difference. First operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 23:52:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:23,602 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-20 23:52:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-02-20 23:52:23,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:23,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:23,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:23,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-02-20 23:52:23,604 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 36 [2022-02-20 23:52:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:23,604 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-02-20 23:52:23,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:52:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:52:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:52:23,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:23,605 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:23,618 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:52:23,812 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:52:23,813 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 652031297, now seen corresponding path program 1 times [2022-02-20 23:52:23,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:23,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536294305] [2022-02-20 23:52:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:23,816 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:52:23,816 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:52:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:23,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:52:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:23,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:23,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:24,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {6681#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); {6681#true} is VALID [2022-02-20 23:52:24,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {6681#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {6681#true} is VALID [2022-02-20 23:52:24,254 INFO L272 TraceCheckUtils]: 2: Hoare triple {6681#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {6681#true} is VALID [2022-02-20 23:52:24,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {6681#true} ~size := #in~size; {6695#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:24,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {6695#(= 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; {6699#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:24,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {6699#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6699#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:24,256 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6699#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {6681#true} #119#return; {6706#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} is VALID [2022-02-20 23:52:24,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {6706#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:24,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {6710#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {6774#(and (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|)))} is VALID [2022-02-20 23:52:24,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {6774#(and (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} is VALID [2022-02-20 23:52:24,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} is VALID [2022-02-20 23:52:24,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} is VALID [2022-02-20 23:52:24,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} assume { :end_inline_ldv_kref_init } true; {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} is VALID [2022-02-20 23:52:24,273 INFO L272 TraceCheckUtils]: 33: Hoare triple {6778#(and (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {6791#(and (= (_ bv16 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (= (_ bv0 32) (bvadd (_ bv4294967292 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} is VALID [2022-02-20 23:52:24,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {6791#(and (= (_ bv16 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (= (_ bv0 32) (bvadd (_ bv4294967292 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {6795#(and (= (_ bv0 32) (bvadd (_ bv4294967292 32) LDV_INIT_LIST_HEAD_~list.offset)) (= (_ bv16 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} is VALID [2022-02-20 23:52:24,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {6795#(and (= (_ bv0 32) (bvadd (_ bv4294967292 32) LDV_INIT_LIST_HEAD_~list.offset)) (= (_ bv16 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {6682#false} is VALID [2022-02-20 23:52:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:24,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:24,274 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:24,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536294305] [2022-02-20 23:52:24,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536294305] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:24,274 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:24,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:52:24,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643054344] [2022-02-20 23:52:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:24,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 36 [2022-02-20 23:52:24,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:24,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:52:24,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:24,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:52:24,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:24,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:52:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:52:24,303 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:52:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:25,184 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:52:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:52:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 36 [2022-02-20 23:52:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:52:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-02-20 23:52:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:52:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-02-20 23:52:25,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-02-20 23:52:25,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:25,269 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:52:25,269 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:52:25,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:52:25,269 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 147 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:25,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 279 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:52:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:52:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-02-20 23:52:25,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:25,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:25,272 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:25,272 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:25,273 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:52:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:52:25,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:25,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:25,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:25,274 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:25,274 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:52:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:52:25,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:25,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:25,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:25,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-02-20 23:52:25,276 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2022-02-20 23:52:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:25,276 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-02-20 23:52:25,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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:52:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:52:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:52:25,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:25,277 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:25,297 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:52:25,484 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:52:25,485 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 601347293, now seen corresponding path program 1 times [2022-02-20 23:52:25,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:25,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29491708] [2022-02-20 23:52:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:25,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:25,486 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:52:25,487 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:52:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:25,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:52:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:25,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:25,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {7122#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); {7122#true} is VALID [2022-02-20 23:52:25,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {7122#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {7122#true} is VALID [2022-02-20 23:52:25,733 INFO L272 TraceCheckUtils]: 2: Hoare triple {7122#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {7122#true} is VALID [2022-02-20 23:52:25,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {7122#true} ~size := #in~size; {7122#true} is VALID [2022-02-20 23:52:25,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {7122#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; {7139#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {7139#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {7139#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,738 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7139#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {7122#true} #119#return; {7146#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {7150#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {7214#(not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {7214#(not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| (_ bv0 32)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {7218#(not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:25,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {7218#(not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (_ bv0 32)))} assume ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32; {7123#false} is VALID [2022-02-20 23:52:25,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {7123#false} assume { :end_inline_ldv_kobject_init_internal } true; {7123#false} is VALID [2022-02-20 23:52:25,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {7123#false} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {7123#false} is VALID [2022-02-20 23:52:25,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {7123#false} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {7123#false} is VALID [2022-02-20 23:52:25,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {7123#false} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {7123#false} is VALID [2022-02-20 23:52:25,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {7123#false} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {7123#false} is VALID [2022-02-20 23:52:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:25,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:25,749 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:25,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29491708] [2022-02-20 23:52:25,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29491708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:25,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:25,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:52:25,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98919296] [2022-02-20 23:52:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:52:25,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:25,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:25,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:25,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:52:25,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:52:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:25,768 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:26,049 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-02-20 23:52:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:52:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-02-20 23:52:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-02-20 23:52:26,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-02-20 23:52:26,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:26,125 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:52:26,125 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:52:26,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:26,126 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 138 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:26,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 219 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:52:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-02-20 23:52:26,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:26,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,128 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,128 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:26,129 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-02-20 23:52:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-02-20 23:52:26,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:26,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:26,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:26,131 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:26,132 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-02-20 23:52:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-02-20 23:52:26,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:26,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:26,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:26,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-02-20 23:52:26,134 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 36 [2022-02-20 23:52:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:26,134 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-02-20 23:52:26,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-02-20 23:52:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:52:26,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:26,135 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:26,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:26,343 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:52:26,343 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -499536070, now seen corresponding path program 1 times [2022-02-20 23:52:26,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:26,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921201557] [2022-02-20 23:52:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:26,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:26,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:26,345 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:52:26,346 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:52:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:26,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:52:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:26,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:26,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:26,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {7556#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); {7556#true} is VALID [2022-02-20 23:52:26,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {7556#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {7556#true} is VALID [2022-02-20 23:52:26,712 INFO L272 TraceCheckUtils]: 2: Hoare triple {7556#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {7556#true} is VALID [2022-02-20 23:52:26,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {7556#true} ~size := #in~size; {7556#true} is VALID [2022-02-20 23:52:26,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {7556#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; {7573#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:26,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {7573#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {7573#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:26,713 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7573#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {7556#true} #119#return; {7580#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {7580#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kref_init } true; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,722 INFO L272 TraceCheckUtils]: 33: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} is VALID [2022-02-20 23:52:26,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} is VALID [2022-02-20 23:52:26,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} is VALID [2022-02-20 23:52:26,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} is VALID [2022-02-20 23:52:26,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} assume true; {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} is VALID [2022-02-20 23:52:26,724 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7663#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_1|) (_ bv1 1)))} {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} #121#return; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kobject_init_internal } true; {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {7584#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {7685#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {7685#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv1 1))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {7689#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|))} is VALID [2022-02-20 23:52:26,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {7689#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {7693#(= (select |#valid| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:26,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {7693#(= (select |#valid| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[ldv_atomic_sub_return_~v#1.base]); {7557#false} is VALID [2022-02-20 23:52:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:26,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:26,727 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:26,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921201557] [2022-02-20 23:52:26,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921201557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:26,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:26,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:52:26,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459760834] [2022-02-20 23:52:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:52:26,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:26,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:26,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:52:26,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:52:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:26,759 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:27,184 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:52:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:52:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:52:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-02-20 23:52:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-02-20 23:52:27,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2022-02-20 23:52:27,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:27,250 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:52:27,250 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:52:27,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:52:27,251 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 140 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:27,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 142 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-02-20 23:52:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:52:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2022-02-20 23:52:27,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:27,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,256 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,256 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:27,258 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:52:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-02-20 23:52:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:27,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:27,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 23:52:27,259 INFO L87 Difference]: Start difference. First operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 23:52:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:27,260 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-02-20 23:52:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-02-20 23:52:27,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:27,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:27,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:27,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-02-20 23:52:27,261 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 44 [2022-02-20 23:52:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:27,261 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-02-20 23:52:27,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-02-20 23:52:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:52:27,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:27,263 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:27,271 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:52:27,470 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:52:27,471 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash -499536069, now seen corresponding path program 1 times [2022-02-20 23:52:27,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:27,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503796370] [2022-02-20 23:52:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:27,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:27,472 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:52:27,473 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:52:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:27,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:52:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:27,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:27,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:27,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {8040#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); {8040#true} is VALID [2022-02-20 23:52:27,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {8040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {8040#true} is VALID [2022-02-20 23:52:27,991 INFO L272 TraceCheckUtils]: 2: Hoare triple {8040#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {8040#true} is VALID [2022-02-20 23:52:27,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {8040#true} ~size := #in~size; {8054#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:27,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {8054#(= 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; {8058#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:27,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {8058#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {8058#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:27,993 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8058#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {8040#true} #119#return; {8065#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} is VALID [2022-02-20 23:52:27,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {8065#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:27,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kref_init } true; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,007 INFO L272 TraceCheckUtils]: 33: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} is VALID [2022-02-20 23:52:28,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} is VALID [2022-02-20 23:52:28,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} is VALID [2022-02-20 23:52:28,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} is VALID [2022-02-20 23:52:28,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} assume true; {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} is VALID [2022-02-20 23:52:28,010 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8148#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_2|) (_ bv16 32)))} {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} #121#return; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kobject_init_internal } true; {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:28,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {8170#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#res#1.base|)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:28,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {8170#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#res#1.base|)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {8174#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:28,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {8174#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {8178#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:52:28,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {8178#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ldv_atomic_sub_return_~v#1.offset), #length[ldv_atomic_sub_return_~v#1.base]) && ~bvule32(ldv_atomic_sub_return_~v#1.offset, ~bvadd32(4bv32, ldv_atomic_sub_return_~v#1.offset))) && ~bvule32(0bv32, ldv_atomic_sub_return_~v#1.offset)); {8041#false} is VALID [2022-02-20 23:52:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:28,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:28,017 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:28,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503796370] [2022-02-20 23:52:28,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503796370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:28,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:28,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:52:28,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559023227] [2022-02-20 23:52:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:52:28,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:28,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:28,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:52:28,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:52:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:52:28,052 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:28,685 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-02-20 23:52:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:52:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 23:52:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-20 23:52:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-02-20 23:52:28,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-02-20 23:52:28,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:28,765 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:52:28,765 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:52:28,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:52:28,766 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 191 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:28,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 210 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2022-02-20 23:52:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:52:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-02-20 23:52:28,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:28,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,767 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,768 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:28,768 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-02-20 23:52:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-02-20 23:52:28,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:28,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:28,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:28,769 INFO L87 Difference]: Start difference. First operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:28,770 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-02-20 23:52:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-02-20 23:52:28,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:28,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:28,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:28,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-02-20 23:52:28,772 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 44 [2022-02-20 23:52:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:28,772 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-02-20 23:52:28,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-02-20 23:52:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 23:52:28,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:28,773 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:28,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-02-20 23:52:28,973 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:52:28,973 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 983653340, now seen corresponding path program 1 times [2022-02-20 23:52:28,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:28,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650468151] [2022-02-20 23:52:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:28,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:28,975 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:52:28,976 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:52:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:29,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:52:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:29,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:29,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {8501#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); {8501#true} is VALID [2022-02-20 23:52:29,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {8501#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {8501#true} is VALID [2022-02-20 23:52:29,271 INFO L272 TraceCheckUtils]: 2: Hoare triple {8501#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {8501#true} is VALID [2022-02-20 23:52:29,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {8501#true} ~size := #in~size; {8501#true} is VALID [2022-02-20 23:52:29,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {8501#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; {8518#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {8518#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {8518#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,273 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8518#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {8501#true} #119#return; {8525#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {8525#(not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume { :end_inline_ldv_kref_init } true; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,281 INFO L272 TraceCheckUtils]: 33: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {8501#true} is VALID [2022-02-20 23:52:29,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {8501#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {8501#true} is VALID [2022-02-20 23:52:29,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {8501#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {8501#true} is VALID [2022-02-20 23:52:29,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {8501#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {8501#true} is VALID [2022-02-20 23:52:29,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {8501#true} assume true; {8501#true} is VALID [2022-02-20 23:52:29,282 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8501#true} {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} #121#return; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume { :end_inline_ldv_kobject_init_internal } true; {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {8529#(not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32)))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {8629#(not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {8629#(not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {8633#(not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:29,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {8633#(not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32)))} assume !(ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32); {8502#false} is VALID [2022-02-20 23:52:29,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {8502#false} assume { :end_inline_ldv_kobject_put } true; {8502#false} is VALID [2022-02-20 23:52:29,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {8502#false} assume { :end_inline_entry_point } true; {8502#false} is VALID [2022-02-20 23:52:29,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {8502#false} assume !(#valid == main_old_#valid#1); {8502#false} is VALID [2022-02-20 23:52:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:29,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:29,284 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:29,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650468151] [2022-02-20 23:52:29,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650468151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:29,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:29,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:52:29,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009004785] [2022-02-20 23:52:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-02-20 23:52:29,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:29,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:29,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:52:29,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:29,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:52:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:29,322 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:29,600 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-02-20 23:52:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-02-20 23:52:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 23:52:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 23:52:29,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 23:52:29,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:29,671 INFO L225 Difference]: With dead ends: 75 [2022-02-20 23:52:29,671 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 23:52:29,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:52:29,672 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 105 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:29,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 215 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 23:52:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-02-20 23:52:29,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:29,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,674 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,674 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:29,675 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-02-20 23:52:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 23:52:29,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:29,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:29,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-02-20 23:52:29,676 INFO L87 Difference]: Start difference. First operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 75 states. [2022-02-20 23:52:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:29,677 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-02-20 23:52:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 23:52:29,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:29,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:29,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:29,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-02-20 23:52:29,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 46 [2022-02-20 23:52:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:29,678 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-02-20 23:52:29,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-02-20 23:52:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:52:29,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:29,679 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:29,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:29,888 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:52:29,888 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash 567271038, now seen corresponding path program 1 times [2022-02-20 23:52:29,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:29,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68268827] [2022-02-20 23:52:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:29,890 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:52:29,890 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:52:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:30,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:52:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:30,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:30,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {8949#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); {8949#true} is VALID [2022-02-20 23:52:30,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {8949#true} is VALID [2022-02-20 23:52:30,361 INFO L272 TraceCheckUtils]: 2: Hoare triple {8949#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {8949#true} is VALID [2022-02-20 23:52:30,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {8949#true} ~size := #in~size; {8949#true} is VALID [2022-02-20 23:52:30,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {8949#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; {8966#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:30,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {8966#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {8966#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:30,362 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8966#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {8949#true} #119#return; {8973#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {8973#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|) (_ bv1 1))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kref_init } true; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,370 INFO L272 TraceCheckUtils]: 33: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:52:30,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:52:30,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:52:30,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:52:30,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} assume true; {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} is VALID [2022-02-20 23:52:30,371 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9056#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= (select |#valid| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_4|) (_ bv1 1)))} {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} #121#return; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kobject_init_internal } true; {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {8977#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (_ bv1 1))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {9078#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {9078#(= (select |#valid| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv1 1))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {9082#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|))} is VALID [2022-02-20 23:52:30,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {9082#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {9086#(= (select |#valid| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv1 1))} assume 0bv32 == ldv_kref_sub_#t~ret29#1;havoc ldv_kref_sub_#t~ret29#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_~__mptr~3#1.base, ~bvsub32(ldv_kobject_release_~__mptr~3#1.offset, 12bv32);assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset; {9105#(= (select |#valid| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:30,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {9105#(= (select |#valid| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[ldv_kobject_cleanup_~kobj#1.base]); {8950#false} is VALID [2022-02-20 23:52:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:30,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:30,376 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:30,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68268827] [2022-02-20 23:52:30,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68268827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:30,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:30,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:52:30,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824445683] [2022-02-20 23:52:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:30,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:30,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:30,410 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:52:30,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:52:30,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:52:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:52:30,411 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:30,978 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:52:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:52:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 23:52:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 23:52:30,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-02-20 23:52:31,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:31,034 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:52:31,034 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:52:31,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:52:31,034 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 96 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:31,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 217 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-02-20 23:52:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:52:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2022-02-20 23:52:31,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:31,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,036 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,037 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:31,037 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:52:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-02-20 23:52:31,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:31,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:31,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:31,038 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:52:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:31,039 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-02-20 23:52:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-02-20 23:52:31,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:31,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:31,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:31,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-02-20 23:52:31,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 50 [2022-02-20 23:52:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:31,040 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-02-20 23:52:31,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:52:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:52:31,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:31,041 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:31,053 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:52:31,250 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:52:31,250 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 567271039, now seen corresponding path program 1 times [2022-02-20 23:52:31,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:31,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48389208] [2022-02-20 23:52:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:31,253 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:52:31,255 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:52:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:31,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 23:52:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:31,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:31,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:31,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {9426#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); {9426#true} is VALID [2022-02-20 23:52:31,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {9426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {9426#true} is VALID [2022-02-20 23:52:31,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {9426#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {9426#true} is VALID [2022-02-20 23:52:31,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {9426#true} ~size := #in~size; {9440#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:31,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {9440#(= 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; {9444#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:31,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {9444#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {9444#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:31,876 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9444#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {9426#true} #119#return; {9451#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} is VALID [2022-02-20 23:52:31,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {9451#(and (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base|)))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kref_init } true; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,890 INFO L272 TraceCheckUtils]: 33: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} is VALID [2022-02-20 23:52:31,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} is VALID [2022-02-20 23:52:31,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} is VALID [2022-02-20 23:52:31,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} is VALID [2022-02-20 23:52:31,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} assume true; {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} is VALID [2022-02-20 23:52:31,891 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9534#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv16 32) (select |#length| |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_5|)))} {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} #121#return; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kobject_init_internal } true; {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} is VALID [2022-02-20 23:52:31,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {9455#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {9556#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#res#1.base|)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:31,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {9556#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_create_#res#1.base|)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {9560#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:31,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {9560#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} is VALID [2022-02-20 23:52:31,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {9564#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select |#length| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv16 32)))} assume 0bv32 == ldv_kref_sub_#t~ret29#1;havoc ldv_kref_sub_#t~ret29#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_~__mptr~3#1.base, ~bvsub32(ldv_kobject_release_~__mptr~3#1.offset, 12bv32);assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset; {9583#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)) (= (_ bv12 32) (bvadd |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv12 32))))} is VALID [2022-02-20 23:52:31,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {9583#(and (= (_ bv16 32) (select |#length| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)) (= (_ bv12 32) (bvadd |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv12 32))))} assume !((~bvule32(~bvadd32(4bv32, ldv_kobject_cleanup_~kobj#1.offset), #length[ldv_kobject_cleanup_~kobj#1.base]) && ~bvule32(ldv_kobject_cleanup_~kobj#1.offset, ~bvadd32(4bv32, ldv_kobject_cleanup_~kobj#1.offset))) && ~bvule32(0bv32, ldv_kobject_cleanup_~kobj#1.offset)); {9427#false} is VALID [2022-02-20 23:52:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:31,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:31,896 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:31,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48389208] [2022-02-20 23:52:31,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48389208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:31,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:31,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:52:31,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729860067] [2022-02-20 23:52:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:31,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:31,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:31,938 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:52:31,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:52:31,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:52:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:31,939 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:32,731 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-02-20 23:52:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:52:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-02-20 23:52:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-02-20 23:52:32,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-02-20 23:52:32,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:32,805 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:52:32,805 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:52:32,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:52:32,806 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 152 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:32,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 222 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2022-02-20 23:52:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:52:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-02-20 23:52:32,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:32,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,808 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,808 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:32,809 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-02-20 23:52:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-02-20 23:52:32,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:32,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:32,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 77 states. [2022-02-20 23:52:32,809 INFO L87 Difference]: Start difference. First operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 77 states. [2022-02-20 23:52:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:32,810 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-02-20 23:52:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-02-20 23:52:32,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:32,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:32,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:32,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-02-20 23:52:32,811 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 50 [2022-02-20 23:52:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:32,811 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-02-20 23:52:32,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-02-20 23:52:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 23:52:32,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:32,812 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:32,823 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:52:33,021 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:52:33,022 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1124776918, now seen corresponding path program 1 times [2022-02-20 23:52:33,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:33,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751246401] [2022-02-20 23:52:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:33,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:33,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:33,024 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:52:33,024 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:52:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:33,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:52:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:33,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:33,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {9898#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); {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:33,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:33,801 INFO L272 TraceCheckUtils]: 2: Hoare triple {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:33,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:33,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9916#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:33,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {9916#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {9916#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:33,802 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9916#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {9903#(bvult (_ bv0 32) |#StackHeapBarrier|)} #119#return; {9923#(and (bvult |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:33,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {9923#(and (bvult |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.base| (_ bv0 32))))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume { :end_inline_ldv_kref_init } true; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,816 INFO L272 TraceCheckUtils]: 33: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} is VALID [2022-02-20 23:52:33,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} is VALID [2022-02-20 23:52:33,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} is VALID [2022-02-20 23:52:33,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} is VALID [2022-02-20 23:52:33,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} assume true; {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} is VALID [2022-02-20 23:52:33,818 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10006#(exists ((|v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6| |#StackHeapBarrier|) (not (= (_ bv0 32) |v_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base_BEFORE_CALL_6|))))} {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} #121#return; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume { :end_inline_ldv_kobject_init_internal } true; {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {9927#(and (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |#StackHeapBarrier|))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {10028#(and (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {10028#(and (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kobject_create_#res#1.base| |#StackHeapBarrier|))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {10032#(and (bvult |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:33,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {10032#(and (bvult |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| (_ bv0 32))))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:33,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {10036#(and (not (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |#StackHeapBarrier|))} assume 0bv32 == ldv_kref_sub_#t~ret29#1;havoc ldv_kref_sub_#t~ret29#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_~__mptr~3#1.base, ~bvsub32(ldv_kobject_release_~__mptr~3#1.offset, 12bv32);assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset; {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} is VALID [2022-02-20 23:52:33,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} SUMMARY for call ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset := read~$Pointer$(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, 4bv32); srcloc: L699 {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} is VALID [2022-02-20 23:52:33,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset := ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset; {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} is VALID [2022-02-20 23:52:33,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} assume 0bv32 == ldv_kobject_cleanup_~kobj#1.offset; {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} is VALID [2022-02-20 23:52:33,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {10055#(and (bvult |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|)))} assume !~bvult32(ldv_kobject_cleanup_~kobj#1.base, #StackHeapBarrier); {9899#false} is VALID [2022-02-20 23:52:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:33,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:33,825 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:33,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751246401] [2022-02-20 23:52:33,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751246401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:33,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:33,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:52:33,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376602438] [2022-02-20 23:52:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-02-20 23:52:33,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:33,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:33,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:33,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:52:33,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:52:33,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:52:33,872 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:34,582 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:52:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:52:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-02-20 23:52:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-02-20 23:52:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-02-20 23:52:34,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2022-02-20 23:52:34,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:34,675 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:52:34,675 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:52:34,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:52:34,676 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 191 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:34,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 209 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-20 23:52:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:52:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2022-02-20 23:52:34,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:34,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,677 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,678 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:34,678 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:52:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-20 23:52:34,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:34,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:34,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:52:34,679 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 76 states. [2022-02-20 23:52:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:34,680 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-02-20 23:52:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-02-20 23:52:34,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:34,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:34,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:34,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-02-20 23:52:34,681 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2022-02-20 23:52:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:34,682 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-02-20 23:52:34,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-02-20 23:52:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 23:52:34,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:34,682 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:34,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:34,902 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:52:34,903 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash 350499748, now seen corresponding path program 1 times [2022-02-20 23:52:34,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:34,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404523676] [2022-02-20 23:52:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:34,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:34,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:34,906 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:52:34,908 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:52:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:35,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 23:52:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:35,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:35,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:35,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:52:35,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:52:35,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-02-20 23:52:39,487 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1565 (_ BitVec 8)) (v_ArrVal_1567 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1565) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1567)))) is different from true [2022-02-20 23:52:39,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:39,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:52:39,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-02-20 23:52:39,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:52:39,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-02-20 23:52:39,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {10373#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); {10373#true} is VALID [2022-02-20 23:52:39,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {10373#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {10373#true} is VALID [2022-02-20 23:52:39,931 INFO L272 TraceCheckUtils]: 2: Hoare triple {10373#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {10373#true} is VALID [2022-02-20 23:52:39,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {10373#true} ~size := #in~size; {10373#true} is VALID [2022-02-20 23:52:39,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {10373#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; {10390#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {10390#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {10390#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,932 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10390#(= |ldv_malloc_#res.offset| (_ bv0 32))} {10373#true} #119#return; {10397#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {10397#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:39,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {10401#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {10465#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|))} is VALID [2022-02-20 23:52:39,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {10465#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {10469#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:39,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {10469#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {10473#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:39,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {10473#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {10477#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv13 32)))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))))} is VALID [2022-02-20 23:52:39,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {10477#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv13 32)))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))))} assume { :end_inline_ldv_kref_init } true; {10477#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv13 32)))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))))} is VALID [2022-02-20 23:52:39,944 INFO L272 TraceCheckUtils]: 33: Hoare triple {10477#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv13 32)))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {10484#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:52:39,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {10484#(= |#memory_int| |old(#memory_int)|)} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {10488#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_int| |old(#memory_int)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:52:39,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {10488#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_int| |old(#memory_int)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {10492#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (exists ((v_ArrVal_1565 (_ BitVec 8))) (= |#memory_int| (store |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1565)))) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:52:40,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {10492#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (exists ((v_ArrVal_1565 (_ BitVec 8))) (= |#memory_int| (store |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1565)))) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {10496#(exists ((v_ArrVal_1565 (_ BitVec 8)) (v_ArrVal_1567 (_ BitVec 8))) (= (store |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1565) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1567)) |#memory_int|))} is VALID [2022-02-20 23:52:40,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {10496#(exists ((v_ArrVal_1565 (_ BitVec 8)) (v_ArrVal_1567 (_ BitVec 8))) (= (store |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1565) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1567)) |#memory_int|))} assume true; {10496#(exists ((v_ArrVal_1565 (_ BitVec 8)) (v_ArrVal_1567 (_ BitVec 8))) (= (store |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1565) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1567)) |#memory_int|))} is VALID [2022-02-20 23:52:40,917 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10496#(exists ((v_ArrVal_1565 (_ BitVec 8)) (v_ArrVal_1567 (_ BitVec 8))) (= (store |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1565) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1567)) |#memory_int|))} {10477#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv13 32)))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))))} #121#return; {10503#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv13 32)))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))))} is VALID [2022-02-20 23:52:40,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {10503#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv13 32)))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))))} assume { :end_inline_ldv_kobject_init_internal } true; {10503#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv13 32)))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))))} is VALID [2022-02-20 23:52:40,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {10503#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd (_ bv14 32) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= ((_ extract 15 8) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv13 32)))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv15 32))) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (bvadd |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv12 32))) ((_ extract 7 0) (_ bv1 32))))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {10510#(and (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv15 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:40,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {10510#(and (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv15 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {10514#(and (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv15 32))))} is VALID [2022-02-20 23:52:40,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {10514#(and (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv15 32))))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {10518#(and (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= (_ bv1 32) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv15 32)) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)))} is VALID [2022-02-20 23:52:40,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {10518#(and (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv14 32)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv13 32)) ((_ extract 15 8) (_ bv1 32))) (= (_ bv1 32) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv15 32)) ((_ extract 31 24) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (_ bv12 32)) ((_ extract 7 0) (_ bv1 32))) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {10522#(and (= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) |ULTIMATE.start_ldv_atomic_sub_return_#t~mem28#1|) (= (_ bv1 32) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|))} is VALID [2022-02-20 23:52:40,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {10522#(and (= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) |ULTIMATE.start_ldv_atomic_sub_return_#t~mem28#1|) (= (_ bv1 32) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {10526#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:40,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {10526#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| (_ bv1 32)))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {10526#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:40,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {10526#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| (_ bv1 32)))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {10533#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_#res#1| (_ bv1 32)))} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {10533#(= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (bvadd |ULTIMATE.start_ldv_atomic_sub_return_#res#1| (_ bv1 32)))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {10537#(= (bvadd (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (_ bv4294967295 32)) |ULTIMATE.start_ldv_kref_sub_#t~ret29#1|)} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {10537#(= (bvadd (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) (_ bv4294967295 32)) |ULTIMATE.start_ldv_kref_sub_#t~ret29#1|)} assume !(0bv32 == ldv_kref_sub_#t~ret29#1);havoc ldv_kref_sub_#t~ret29#1;ldv_kref_sub_#res#1 := 0bv32; {10374#false} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {10374#false} ldv_kref_put_#t~ret31#1 := ldv_kref_sub_#res#1;assume { :end_inline_ldv_kref_sub } true;ldv_kref_put_#res#1 := ldv_kref_put_#t~ret31#1;havoc ldv_kref_put_#t~ret31#1; {10374#false} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {10374#false} ldv_kobject_put_#t~ret33#1 := ldv_kref_put_#res#1;assume { :end_inline_ldv_kref_put } true;havoc ldv_kobject_put_#t~ret33#1; {10374#false} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {10374#false} assume { :end_inline_ldv_kobject_put } true; {10374#false} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {10374#false} assume { :end_inline_entry_point } true; {10374#false} is VALID [2022-02-20 23:52:40,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {10374#false} assume !(#valid == main_old_#valid#1); {10374#false} is VALID [2022-02-20 23:52:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-02-20 23:52:40,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:40,923 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:40,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404523676] [2022-02-20 23:52:40,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404523676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:40,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:40,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 23:52:40,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658352627] [2022-02-20 23:52:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:40,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-02-20 23:52:40,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:40,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:41,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:41,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 23:52:41,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 23:52:41,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=334, Unknown=2, NotChecked=36, Total=420 [2022-02-20 23:52:41,584 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:43,556 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-02-20 23:52:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:52:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-02-20 23:52:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-02-20 23:52:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 56 transitions. [2022-02-20 23:52:43,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 56 transitions. [2022-02-20 23:52:45,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:45,701 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:52:45,701 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:52:45,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=136, Invalid=858, Unknown=2, NotChecked=60, Total=1056 [2022-02-20 23:52:45,702 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 98 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:45,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 475 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 294 Invalid, 0 Unknown, 91 Unchecked, 0.6s Time] [2022-02-20 23:52:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:52:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-20 23:52:45,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:45,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:45,704 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:45,704 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:45,705 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-02-20 23:52:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 23:52:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:45,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:45,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 23:52:45,705 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 23:52:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:45,706 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-02-20 23:52:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 23:52:45,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:45,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:45,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:45,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-02-20 23:52:45,707 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 54 [2022-02-20 23:52:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:45,708 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-02-20 23:52:45,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 23:52:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 23:52:45,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:45,708 INFO L514 BasicCegarLoop]: trace histogram [16, 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:52:45,722 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:52:45,915 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:52:45,915 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:52:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1105784610, now seen corresponding path program 1 times [2022-02-20 23:52:45,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:45,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191683994] [2022-02-20 23:52:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:45,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:45,917 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:52:45,918 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:52:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:46,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 120 conjunts are in the unsatisfiable core [2022-02-20 23:52:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:46,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:46,372 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 14 treesize of output 10 [2022-02-20 23:52:46,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,421 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 25 treesize of output 24 [2022-02-20 23:52:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,481 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:52:46,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,521 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:52:46,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,584 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 22 treesize of output 21 [2022-02-20 23:52:46,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,628 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:52:46,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,682 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 22 treesize of output 21 [2022-02-20 23:52:46,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,733 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:52:46,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,790 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:52:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,849 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 22 treesize of output 21 [2022-02-20 23:52:46,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,898 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:52:46,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:46,968 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:52:47,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,029 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 22 treesize of output 21 [2022-02-20 23:52:47,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,086 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 22 treesize of output 21 [2022-02-20 23:52:47,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,142 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:52:47,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,197 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:52:47,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:47,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-02-20 23:52:52,160 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |c_#memory_$Pointer$.offset|)) is different from true [2022-02-20 23:52:52,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-02-20 23:52:52,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:52,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-02-20 23:52:52,474 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:52:52,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {10859#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); {10859#true} is VALID [2022-02-20 23:52:52,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {10859#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {10859#true} is VALID [2022-02-20 23:52:52,539 INFO L272 TraceCheckUtils]: 2: Hoare triple {10859#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {10859#true} is VALID [2022-02-20 23:52:52,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {10859#true} ~size := #in~size; {10859#true} is VALID [2022-02-20 23:52:52,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {10859#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; {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:52,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:52,540 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} {10859#true} #119#return; {10883#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:52,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {10883#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {10887#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:52,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {10887#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {10898#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {10898#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10902#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {10902#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10906#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10910#(and (= (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {10910#(and (= (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10914#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10918#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {10918#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10922#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {10922#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10926#(and (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {10926#(and (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10930#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {10930#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10934#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {10934#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10938#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {10938#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10942#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv11 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {10942#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv11 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10946#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv12 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {10946#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv12 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10950#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {10950#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10954#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {10954#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10958#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv15 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:52,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {10958#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv15 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:52,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:52,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {10969#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:52,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {10969#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:52,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {10977#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:52,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {10977#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:52,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} assume { :end_inline_ldv_kref_init } true; {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:52,562 INFO L272 TraceCheckUtils]: 33: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {10987#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2022-02-20 23:52:52,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {10987#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {10991#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:52:52,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {10991#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {10995#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (exists ((v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1748)) |#memory_$Pointer$.offset|)))} is VALID [2022-02-20 23:52:53,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {10995#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (exists ((v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1748)) |#memory_$Pointer$.offset|)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {10999#(exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |#memory_$Pointer$.offset|))} is VALID [2022-02-20 23:52:53,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#(exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |#memory_$Pointer$.offset|))} assume true; {10999#(exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |#memory_$Pointer$.offset|))} is VALID [2022-02-20 23:52:53,987 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#(exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |#memory_$Pointer$.offset|))} {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} #121#return; {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:53,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume { :end_inline_ldv_kobject_init_internal } true; {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:53,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {11012#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:53,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {11012#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {11016#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {11016#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {11020#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {11030#(and (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} assume 0bv32 == ldv_kref_sub_#t~ret29#1;havoc ldv_kref_sub_#t~ret29#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_~__mptr~3#1.base, ~bvsub32(ldv_kobject_release_~__mptr~3#1.offset, 12bv32);assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset; {11040#(and (= (_ bv12 32) (bvadd |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:52:53,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {11040#(and (= (_ bv12 32) (bvadd |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv12 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset := read~$Pointer$(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, 4bv32); srcloc: L699 {11044#(= |ULTIMATE.start_ldv_kobject_cleanup_#t~mem32#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {11044#(= |ULTIMATE.start_ldv_kobject_cleanup_#t~mem32#1.offset| (_ bv0 32))} ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset := ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset; {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume 0bv32 == ldv_kobject_cleanup_~kobj#1.offset; {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume ~bvult32(ldv_kobject_cleanup_~kobj#1.base, #StackHeapBarrier); {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume 0bv32 == ldv_kobject_cleanup_~kobj#1.base || 1bv1 == #valid[ldv_kobject_cleanup_~kobj#1.base];call ULTIMATE.dealloc(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset); {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume ldv_kobject_cleanup_~name~0#1.base != 0bv32 || ldv_kobject_cleanup_~name~0#1.offset != 0bv32; {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:53,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume !(0bv32 == ldv_kobject_cleanup_~name~0#1.offset); {10860#false} is VALID [2022-02-20 23:52:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:54,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:54,681 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:54,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191683994] [2022-02-20 23:52:54,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191683994] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:52:54,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [309060357] [2022-02-20 23:52:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:52:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:52:54,683 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:52:54,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-02-20 23:52:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:55,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 116 conjunts are in the unsatisfiable core [2022-02-20 23:52:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:55,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:55,296 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 14 treesize of output 10 [2022-02-20 23:52:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,338 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 25 treesize of output 24 [2022-02-20 23:52:55,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,375 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:52:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,400 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 22 treesize of output 21 [2022-02-20 23:52:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,438 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 22 treesize of output 21 [2022-02-20 23:52:55,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,471 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:52:55,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,495 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:52:55,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,544 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 22 treesize of output 21 [2022-02-20 23:52:55,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,605 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 22 treesize of output 21 [2022-02-20 23:52:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,653 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:52:55,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,718 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 22 treesize of output 21 [2022-02-20 23:52:55,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,781 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 22 treesize of output 21 [2022-02-20 23:52:55,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,825 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 22 treesize of output 21 [2022-02-20 23:52:55,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,878 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 22 treesize of output 21 [2022-02-20 23:52:55,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,914 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:52:55,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:55,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:52:56,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:56,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-02-20 23:52:59,010 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)))) is different from true [2022-02-20 23:52:59,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:59,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:59,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:59,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-02-20 23:52:59,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-02-20 23:52:59,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:52:59,274 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:52:59,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {10859#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); {10859#true} is VALID [2022-02-20 23:52:59,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {10859#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset, entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;assume { :begin_inline_ldv_kobject_create } true;havoc ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset, ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset, ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {10859#true} is VALID [2022-02-20 23:52:59,373 INFO L272 TraceCheckUtils]: 2: Hoare triple {10859#true} call ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset := ldv_malloc(16bv32); {10859#true} is VALID [2022-02-20 23:52:59,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {10859#true} ~size := #in~size; {10859#true} is VALID [2022-02-20 23:52:59,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {10859#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; {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:59,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:59,374 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10876#(= |ldv_malloc_#res.offset| (_ bv0 32))} {10859#true} #119#return; {10883#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:59,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {10883#(= |ULTIMATE.start_ldv_kobject_create_#t~ret34#1.offset| (_ bv0 32))} ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset := ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset;havoc ldv_kobject_create_#t~ret34#1.base, ldv_kobject_create_#t~ret34#1.offset; {10887#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:59,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {10887#(= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32))} assume !(ldv_kobject_create_~kobj~1#1.base == 0bv32 && ldv_kobject_create_~kobj~1#1.offset == 0bv32);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset, 0bv32, 16bv32; {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);assume 1bv1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume (~bvule32(~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset), #length[#Ultimate.C_memset_#ptr#1.base]) && ~bvule32(#Ultimate.C_memset_#ptr#1.offset, ~bvadd32(#Ultimate.C_memset_#amount#1, #Ultimate.C_memset_#ptr#1.offset))) && ~bvule32(0bv32, #Ultimate.C_memset_#ptr#1.offset);havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0bv32; {10898#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {10898#(and (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10902#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {10902#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10906#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (bvadd |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10910#(and (= (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {10910#(and (= (_ bv3 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10914#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10918#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {10918#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10922#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {10922#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv6 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10926#(and (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {10926#(and (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10930#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {10930#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv8 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10934#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {10934#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv9 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10938#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {10938#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv9 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10942#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv11 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {10942#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (_ bv11 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10946#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv12 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {10946#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| (_ bv12 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10950#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {10950#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10954#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {10954#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= (bvadd (_ bv4294967294 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (_ bv12 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10958#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv15 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} is VALID [2022-02-20 23:52:59,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {10958#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv15 32) |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|))} assume ~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1);#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := #Ultimate.C_memset_#value#1[8:0]];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := 0bv32], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,~bvadd32(#Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#t~loopctr39#1) := ~zero_extendFrom8To32(#Ultimate.C_memset_#value#1[8:0])];#Ultimate.C_memset_#t~loopctr39#1 := ~bvadd32(1bv32, #Ultimate.C_memset_#t~loopctr39#1); {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:59,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume !~bvult32(#Ultimate.C_memset_#t~loopctr39#1, #Ultimate.C_memset_#amount#1); {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:59,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc ldv_kobject_create_#t~memset~res35#1.base, ldv_kobject_create_#t~memset~res35#1.offset;assume { :begin_inline_ldv_kobject_init } true;ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset;havoc ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset := ldv_kobject_init_#in~kobj#1.base, ldv_kobject_init_#in~kobj#1.offset; {10969#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:52:59,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {10969#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume !(ldv_kobject_init_~kobj#1.base == 0bv32 && ldv_kobject_init_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kobject_init_internal } true;ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset := ldv_kobject_init_~kobj#1.base, ldv_kobject_init_~kobj#1.offset;havoc ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset;ldv_kobject_init_internal_~kobj#1.base, ldv_kobject_init_internal_~kobj#1.offset := ldv_kobject_init_internal_#in~kobj#1.base, ldv_kobject_init_internal_#in~kobj#1.offset; {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:59,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} assume !(ldv_kobject_init_internal_~kobj#1.base == 0bv32 && ldv_kobject_init_internal_~kobj#1.offset == 0bv32);assume { :begin_inline_ldv_kref_init } true;ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset := ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_init_internal_~kobj#1.offset);havoc ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset;ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset := ldv_kref_init_#in~kref#1.base, ldv_kref_init_#in~kref#1.offset; {10977#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:59,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {10977#(and (= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| (bvadd |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| (_ bv12 32))) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kref_init_~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} SUMMARY for call write~intINTTYPE4(1bv32, ldv_kref_init_~kref#1.base, ldv_kref_init_~kref#1.offset, 4bv32); srcloc: L682 {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:59,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} assume { :end_inline_ldv_kref_init } true; {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} is VALID [2022-02-20 23:52:59,399 INFO L272 TraceCheckUtils]: 33: Hoare triple {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} call LDV_INIT_LIST_HEAD(ldv_kobject_init_internal_~kobj#1.base, ~bvadd32(4bv32, ldv_kobject_init_internal_~kobj#1.offset)); {10987#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2022-02-20 23:52:59,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {10987#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {10991#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} is VALID [2022-02-20 23:52:59,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {10991#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {10995#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (exists ((v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1748)) |#memory_$Pointer$.offset|)))} is VALID [2022-02-20 23:53:00,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {10995#(and (= |LDV_INIT_LIST_HEAD_#in~list.base| LDV_INIT_LIST_HEAD_~list.base) (= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (exists ((v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_1748)) |#memory_$Pointer$.offset|)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {11233#(exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)) |#memory_$Pointer$.offset|))} is VALID [2022-02-20 23:53:00,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {11233#(exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)) |#memory_$Pointer$.offset|))} assume true; {11233#(exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)) |#memory_$Pointer$.offset|))} is VALID [2022-02-20 23:53:00,862 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11233#(exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) |LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)) |#memory_$Pointer$.offset|))} {10973#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|))} #121#return; {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:53:00,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume { :end_inline_ldv_kobject_init_internal } true; {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} is VALID [2022-02-20 23:53:00,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(and (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))} assume { :end_inline_ldv_kobject_init } true;ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset := ldv_kobject_create_~kobj~1#1.base, ldv_kobject_create_~kobj~1#1.offset; {11012#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:53:00,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {11012#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_ldv_kobject_create_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset := ldv_kobject_create_#res#1.base, ldv_kobject_create_#res#1.offset;assume { :end_inline_ldv_kobject_create } true;entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset := entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;havoc entry_point_#t~ret38#1.base, entry_point_#t~ret38#1.offset;assume { :begin_inline_ldv_kobject_put } true;ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset := entry_point_~kobj~2#1.base, entry_point_~kobj~2#1.offset;havoc ldv_kobject_put_#t~ret33#1, ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset;ldv_kobject_put_~kobj#1.base, ldv_kobject_put_~kobj#1.offset := ldv_kobject_put_#in~kobj#1.base, ldv_kobject_put_#in~kobj#1.offset; {11016#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:53:00,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {11016#(and (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) (_ bv0 32)) (_ bv0 32)))} assume ldv_kobject_put_~kobj#1.base != 0bv32 || ldv_kobject_put_~kobj#1.offset != 0bv32;assume { :begin_inline_ldv_kref_put } true;ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset, ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset := ldv_kobject_put_~kobj#1.base, ~bvadd32(12bv32, ldv_kobject_put_~kobj#1.offset), #funAddr~ldv_kobject_release.base, #funAddr~ldv_kobject_release.offset;havoc ldv_kref_put_#res#1;havoc ldv_kref_put_#t~ret31#1, ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset := ldv_kref_put_#in~kref#1.base, ldv_kref_put_#in~kref#1.offset;ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset := ldv_kref_put_#in~release#1.base, ldv_kref_put_#in~release#1.offset;assume { :begin_inline_ldv_kref_sub } true;ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset, ldv_kref_sub_#in~count#1, ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset := ldv_kref_put_~kref#1.base, ldv_kref_put_~kref#1.offset, 1bv32, ldv_kref_put_~release#1.base, ldv_kref_put_~release#1.offset;havoc ldv_kref_sub_#res#1;havoc ldv_kref_sub_#t~ret29#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~count#1, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset := ldv_kref_sub_#in~kref#1.base, ldv_kref_sub_#in~kref#1.offset;ldv_kref_sub_~count#1 := ldv_kref_sub_#in~count#1;ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset := ldv_kref_sub_#in~release#1.base, ldv_kref_sub_#in~release#1.offset;assume { :begin_inline_ldv_atomic_sub_return } true;ldv_atomic_sub_return_#in~i#1, ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset := ldv_kref_sub_~count#1, ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset;havoc ldv_atomic_sub_return_#res#1;havoc ldv_atomic_sub_return_#t~mem28#1, ldv_atomic_sub_return_~i#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, ldv_atomic_sub_return_~temp~1#1;ldv_atomic_sub_return_~i#1 := ldv_atomic_sub_return_#in~i#1;ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset := ldv_atomic_sub_return_#in~v#1.base, ldv_atomic_sub_return_#in~v#1.offset;havoc ldv_atomic_sub_return_~temp~1#1; {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:53:00,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call ldv_atomic_sub_return_#t~mem28#1 := read~intINTTYPE4(ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L666 {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:53:00,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} ldv_atomic_sub_return_~temp~1#1 := ldv_atomic_sub_return_#t~mem28#1;havoc ldv_atomic_sub_return_#t~mem28#1;ldv_atomic_sub_return_~temp~1#1 := ~bvsub32(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~i#1); {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:53:00,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {11252#(and (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(ldv_atomic_sub_return_~temp~1#1, ldv_atomic_sub_return_~v#1.base, ldv_atomic_sub_return_~v#1.offset, 4bv32); srcloc: L668 {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} is VALID [2022-02-20 23:53:00,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} ldv_atomic_sub_return_#res#1 := ldv_atomic_sub_return_~temp~1#1; {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} is VALID [2022-02-20 23:53:00,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} ldv_kref_sub_#t~ret29#1 := ldv_atomic_sub_return_#res#1;assume { :end_inline_ldv_atomic_sub_return } true; {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} is VALID [2022-02-20 23:53:00,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {11262#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (_ bv0 32)) (_ bv0 32))} assume 0bv32 == ldv_kref_sub_#t~ret29#1;havoc ldv_kref_sub_#t~ret29#1;assume { :begin_inline_##fun~$Pointer$~TO~VOID } true;##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset, ##fun~$Pointer$~TO~VOID_#in~#fp#1.base, ##fun~$Pointer$~TO~VOID_#in~#fp#1.offset := ldv_kref_sub_~kref#1.base, ldv_kref_sub_~kref#1.offset, ldv_kref_sub_~release#1.base, ldv_kref_sub_~release#1.offset;havoc ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset := ##fun~$Pointer$~TO~VOID_#in~kref#1.base, ##fun~$Pointer$~TO~VOID_#in~kref#1.offset;assume { :begin_inline_ldv_kobject_release } true;ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset := ##fun~$Pointer$~TO~VOID_#~kref#1.base, ##fun~$Pointer$~TO~VOID_#~kref#1.offset;havoc ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset, ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset, ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset := ldv_kobject_release_#in~kref#1.base, ldv_kobject_release_#in~kref#1.offset;ldv_kobject_release_~__mptr~3#1.base, ldv_kobject_release_~__mptr~3#1.offset := ldv_kobject_release_~kref#1.base, ldv_kobject_release_~kref#1.offset;ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset := ldv_kobject_release_~__mptr~3#1.base, ~bvsub32(ldv_kobject_release_~__mptr~3#1.offset, 12bv32);assume { :begin_inline_ldv_kobject_cleanup } true;ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset := ldv_kobject_release_~kobj~0#1.base, ldv_kobject_release_~kobj~0#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset, ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset;ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset := ldv_kobject_cleanup_#in~kobj#1.base, ldv_kobject_cleanup_#in~kobj#1.offset; {11272#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv0 32)) (_ bv0 32))} is VALID [2022-02-20 23:53:00,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {11272#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base|) (_ bv0 32)) (_ bv0 32))} SUMMARY for call ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset := read~$Pointer$(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset, 4bv32); srcloc: L699 {11276#(or (not (= |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv0 32))) (= |ULTIMATE.start_ldv_kobject_cleanup_#t~mem32#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:53:00,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {11276#(or (not (= |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv0 32))) (= |ULTIMATE.start_ldv_kobject_cleanup_#t~mem32#1.offset| (_ bv0 32)))} ldv_kobject_cleanup_~name~0#1.base, ldv_kobject_cleanup_~name~0#1.offset := ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset;havoc ldv_kobject_cleanup_#t~mem32#1.base, ldv_kobject_cleanup_#t~mem32#1.offset; {11280#(or (= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv0 32))))} is VALID [2022-02-20 23:53:00,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {11280#(or (= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.offset| (_ bv0 32))))} assume 0bv32 == ldv_kobject_cleanup_~kobj#1.offset; {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:00,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume ~bvult32(ldv_kobject_cleanup_~kobj#1.base, #StackHeapBarrier); {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:00,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume 0bv32 == ldv_kobject_cleanup_~kobj#1.base || 1bv1 == #valid[ldv_kobject_cleanup_~kobj#1.base];call ULTIMATE.dealloc(ldv_kobject_cleanup_~kobj#1.base, ldv_kobject_cleanup_~kobj#1.offset); {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:00,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume ldv_kobject_cleanup_~name~0#1.base != 0bv32 || ldv_kobject_cleanup_~name~0#1.offset != 0bv32; {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:00,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {11048#(= |ULTIMATE.start_ldv_kobject_cleanup_~name~0#1.offset| (_ bv0 32))} assume !(0bv32 == ldv_kobject_cleanup_~name~0#1.offset); {10860#false} is VALID [2022-02-20 23:53:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:00,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:53:01,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [309060357] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:53:01,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:53:01,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 42 [2022-02-20 23:53:01,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403521249] [2022-02-20 23:53:01,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:53:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-02-20 23:53:01,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:01,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:53:04,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:04,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-20 23:53:04,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:04,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-20 23:53:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2548, Unknown=3, NotChecked=206, Total=2970 [2022-02-20 23:53:04,087 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 43 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:53:11,084 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1944 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1944)))) (exists ((v_ArrVal_1749 (_ BitVec 32)) (v_ArrVal_1748 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1748) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1749)) |c_#memory_$Pointer$.offset|))) is different from true