./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:32:18,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:32:18,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:32:18,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:32:18,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:32:18,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:32:18,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:32:18,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:32:18,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:32:18,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:32:18,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:32:18,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:32:18,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:32:18,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:32:18,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:32:18,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:32:18,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:32:18,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:32:18,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:32:18,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:32:18,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:32:18,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:32:18,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:32:18,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:32:18,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:32:18,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:32:18,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:32:18,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:32:18,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:32:18,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:32:18,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:32:18,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:32:18,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:32:18,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:32:18,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:32:18,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:32:18,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:32:18,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:32:18,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:32:18,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:32:18,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:32:18,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:32:18,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:32:18,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:32:18,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:32:18,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:32:18,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:32:18,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:32:18,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:32:18,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:32:18,191 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:32:18,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:32:18,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:32:18,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:32:18,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:32:18,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:32:18,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:32:18,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:32:18,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:32:18,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:32:18,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:32:18,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:32:18,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:32:18,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:32:18,196 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:32:18,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:32:18,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:32:18,196 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 [2022-02-20 22:32:18,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:32:18,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:32:18,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:32:18,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:32:18,487 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:32:18,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2022-02-20 22:32:18,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc1abd5c/2b8d050e8a564228b5d0d79ee457a69a/FLAG37054617d [2022-02-20 22:32:19,129 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:32:19,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2022-02-20 22:32:19,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc1abd5c/2b8d050e8a564228b5d0d79ee457a69a/FLAG37054617d [2022-02-20 22:32:19,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc1abd5c/2b8d050e8a564228b5d0d79ee457a69a [2022-02-20 22:32:19,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:32:19,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:32:19,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:32:19,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:32:19,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:32:19,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:32:19" (1/1) ... [2022-02-20 22:32:19,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a27044e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:19, skipping insertion in model container [2022-02-20 22:32:19,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:32:19" (1/1) ... [2022-02-20 22:32:19,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:32:19,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:32:20,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2022-02-20 22:32:20,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:32:20,802 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:32:21,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2022-02-20 22:32:21,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:32:21,084 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:32:21,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21 WrapperNode [2022-02-20 22:32:21,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:32:21,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:32:21,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:32:21,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:32:21,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,256 INFO L137 Inliner]: procedures = 147, calls = 851, calls flagged for inlining = 60, calls inlined = 58, statements flattened = 2024 [2022-02-20 22:32:21,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:32:21,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:32:21,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:32:21,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:32:21,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:32:21,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:32:21,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:32:21,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:32:21,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (1/1) ... [2022-02-20 22:32:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:32:21,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:32:21,438 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 22:32:21,442 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 22:32:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:32:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-02-20 22:32:21,469 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-02-20 22:32:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-02-20 22:32:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:32:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:32:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:32:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:32:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:32:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:32:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:32:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:32:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:32:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:32:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:32:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_data [2022-02-20 22:32:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_data [2022-02-20 22:32:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure blk_put_request [2022-02-20 22:32:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_put_request [2022-02-20 22:32:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-02-20 22:32:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-02-20 22:32:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:32:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:32:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:32:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:32:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:32:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure send_mode_select [2022-02-20 22:32:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure send_mode_select [2022-02-20 22:32:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-02-20 22:32:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-02-20 22:32:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:32:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:32:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:32:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:32:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:32:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:32:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:32:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:32:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:32:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:32:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:32:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unregister_device_handler [2022-02-20 22:32:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unregister_device_handler [2022-02-20 22:32:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-02-20 22:32:21,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-02-20 22:32:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-02-20 22:32:21,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-02-20 22:32:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:32:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure submit_inquiry [2022-02-20 22:32:21,479 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_inquiry [2022-02-20 22:32:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_bus_detach [2022-02-20 22:32:21,480 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_bus_detach [2022-02-20 22:32:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:32:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:32:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_match [2022-02-20 22:32:21,481 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_match [2022-02-20 22:32:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:32:21,482 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:32:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 22:32:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure blk_execute_rq [2022-02-20 22:32:21,484 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_execute_rq [2022-02-20 22:32:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:32:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:32:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:32:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-02-20 22:32:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-02-20 22:32:21,486 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-02-20 22:32:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:32:21,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:32:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure check_ownership [2022-02-20 22:32:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure check_ownership [2022-02-20 22:32:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-02-20 22:32:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-02-20 22:32:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:32:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:32:21,487 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_req [2022-02-20 22:32:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_req [2022-02-20 22:32:21,488 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:32:21,488 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:32:21,488 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-02-20 22:32:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-02-20 22:32:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-02-20 22:32:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-02-20 22:32:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:32:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:32:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-02-20 22:32:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-02-20 22:32:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-02-20 22:32:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-02-20 22:32:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:32:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-02-20 22:32:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-02-20 22:32:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:32:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:32:21,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:32:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 22:32:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 22:32:21,884 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:32:21,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:32:22,257 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:32:23,693 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:32:23,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:32:23,717 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:32:23,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:32:23 BoogieIcfgContainer [2022-02-20 22:32:23,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:32:23,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:32:23,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:32:23,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:32:23,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:32:19" (1/3) ... [2022-02-20 22:32:23,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13506379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:32:23, skipping insertion in model container [2022-02-20 22:32:23,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:32:21" (2/3) ... [2022-02-20 22:32:23,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13506379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:32:23, skipping insertion in model container [2022-02-20 22:32:23,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:32:23" (3/3) ... [2022-02-20 22:32:23,729 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2022-02-20 22:32:23,734 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:32:23,734 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:32:23,791 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:32:23,798 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 22:32:23,800 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:32:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 591 states, 436 states have (on average 1.3944954128440368) internal successors, (608), 456 states have internal predecessors, (608), 115 states have call successors, (115), 39 states have call predecessors, (115), 38 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2022-02-20 22:32:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:32:23,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:32:23,859 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:23,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:32:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:32:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash 108901425, now seen corresponding path program 1 times [2022-02-20 22:32:23,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:32:23,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813858157] [2022-02-20 22:32:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:32:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:32:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:32:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,357 INFO L272 TraceCheckUtils]: 1: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,359 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,362 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {595#false} {594#true} #1515#return; {595#false} is VALID [2022-02-20 22:32:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:32:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,420 INFO L272 TraceCheckUtils]: 1: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,421 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,424 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {595#false} {595#false} #1517#return; {595#false} is VALID [2022-02-20 22:32:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:32:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,473 INFO L272 TraceCheckUtils]: 1: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,474 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,476 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {595#false} {595#false} #1519#return; {595#false} is VALID [2022-02-20 22:32:24,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:32:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:24,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {594#true} is VALID [2022-02-20 22:32:24,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {594#true} is VALID [2022-02-20 22:32:24,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {594#true} is VALID [2022-02-20 22:32:24,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {595#false} #1521#return; {595#false} is VALID [2022-02-20 22:32:24,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {594#true} is VALID [2022-02-20 22:32:24,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {594#true} is VALID [2022-02-20 22:32:24,532 INFO L272 TraceCheckUtils]: 2: Hoare triple {594#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:24,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,534 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,534 INFO L272 TraceCheckUtils]: 9: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,536 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {595#false} {594#true} #1515#return; {595#false} is VALID [2022-02-20 22:32:24,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#false} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {595#false} is VALID [2022-02-20 22:32:24,537 INFO L272 TraceCheckUtils]: 18: Hoare triple {595#false} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:24,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,538 INFO L272 TraceCheckUtils]: 20: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,539 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,540 INFO L272 TraceCheckUtils]: 25: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,545 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,548 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {595#false} {595#false} #1517#return; {595#false} is VALID [2022-02-20 22:32:24,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {595#false} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {595#false} is VALID [2022-02-20 22:32:24,549 INFO L272 TraceCheckUtils]: 34: Hoare triple {595#false} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:24,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {594#true} is VALID [2022-02-20 22:32:24,550 INFO L272 TraceCheckUtils]: 36: Hoare triple {594#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:24,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {594#true} is VALID [2022-02-20 22:32:24,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 22:32:24,553 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {594#true} {594#true} #1511#return; {594#true} is VALID [2022-02-20 22:32:24,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {594#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {594#true} is VALID [2022-02-20 22:32:24,554 INFO L272 TraceCheckUtils]: 41: Hoare triple {594#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {594#true} is VALID [2022-02-20 22:32:24,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 22:32:24,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {594#true} assume 0 == ~cond;assume false; {595#false} is VALID [2022-02-20 22:32:24,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,557 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {595#false} {594#true} #1513#return; {595#false} is VALID [2022-02-20 22:32:24,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {595#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {595#false} is VALID [2022-02-20 22:32:24,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {595#false} assume true; {595#false} is VALID [2022-02-20 22:32:24,571 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {595#false} {595#false} #1519#return; {595#false} is VALID [2022-02-20 22:32:24,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {595#false} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {595#false} is VALID [2022-02-20 22:32:24,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {595#false} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {595#false} is VALID [2022-02-20 22:32:24,572 INFO L272 TraceCheckUtils]: 51: Hoare triple {595#false} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:32:24,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {594#true} is VALID [2022-02-20 22:32:24,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {594#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {594#true} is VALID [2022-02-20 22:32:24,572 INFO L290 TraceCheckUtils]: 54: Hoare triple {594#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {594#true} is VALID [2022-02-20 22:32:24,573 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {594#true} {595#false} #1521#return; {595#false} is VALID [2022-02-20 22:32:24,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {595#false} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {595#false} is VALID [2022-02-20 22:32:24,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {595#false} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {595#false} is VALID [2022-02-20 22:32:24,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {595#false} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {595#false} is VALID [2022-02-20 22:32:24,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {595#false} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {595#false} is VALID [2022-02-20 22:32:24,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {595#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {595#false} is VALID [2022-02-20 22:32:24,574 INFO L290 TraceCheckUtils]: 61: Hoare triple {595#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {595#false} is VALID [2022-02-20 22:32:24,574 INFO L290 TraceCheckUtils]: 62: Hoare triple {595#false} assume main_#t~switch332#1; {595#false} is VALID [2022-02-20 22:32:24,574 INFO L290 TraceCheckUtils]: 63: Hoare triple {595#false} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {595#false} is VALID [2022-02-20 22:32:24,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {595#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {595#false} is VALID [2022-02-20 22:32:24,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {595#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {595#false} is VALID [2022-02-20 22:32:24,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {595#false} assume main_#t~switch337#1; {595#false} is VALID [2022-02-20 22:32:24,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {595#false} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {595#false} is VALID [2022-02-20 22:32:24,575 INFO L272 TraceCheckUtils]: 68: Hoare triple {595#false} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {595#false} is VALID [2022-02-20 22:32:24,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {595#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {595#false} is VALID [2022-02-20 22:32:24,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {595#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {595#false} is VALID [2022-02-20 22:32:24,576 INFO L272 TraceCheckUtils]: 71: Hoare triple {595#false} call ldv_error(); {595#false} is VALID [2022-02-20 22:32:24,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {595#false} assume !false; {595#false} is VALID [2022-02-20 22:32:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 22:32:24,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:32:24,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813858157] [2022-02-20 22:32:24,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813858157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:32:24,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:32:24,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:32:24,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137741695] [2022-02-20 22:32:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:32:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:32:24,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:32:24,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:32:24,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:24,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:32:24,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:32:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:32:24,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:32:24,711 INFO L87 Difference]: Start difference. First operand has 591 states, 436 states have (on average 1.3944954128440368) internal successors, (608), 456 states have internal predecessors, (608), 115 states have call successors, (115), 39 states have call predecessors, (115), 38 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:32:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:28,306 INFO L93 Difference]: Finished difference Result 1251 states and 1835 transitions. [2022-02-20 22:32:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:32:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:32:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:32:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:32:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1835 transitions. [2022-02-20 22:32:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:32:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1835 transitions. [2022-02-20 22:32:28,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1835 transitions. [2022-02-20 22:32:30,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1835 edges. 1835 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:30,164 INFO L225 Difference]: With dead ends: 1251 [2022-02-20 22:32:30,165 INFO L226 Difference]: Without dead ends: 646 [2022-02-20 22:32:30,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:32:30,175 INFO L933 BasicCegarLoop]: 792 mSDtfsCounter, 525 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 22:32:30,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 1213 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 22:32:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-02-20 22:32:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 572. [2022-02-20 22:32:30,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:32:30,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-02-20 22:32:30,262 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-02-20 22:32:30,265 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-02-20 22:32:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:30,305 INFO L93 Difference]: Finished difference Result 646 states and 932 transitions. [2022-02-20 22:32:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 932 transitions. [2022-02-20 22:32:30,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:30,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:30,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) Second operand 646 states. [2022-02-20 22:32:30,318 INFO L87 Difference]: Start difference. First operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) Second operand 646 states. [2022-02-20 22:32:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:30,355 INFO L93 Difference]: Finished difference Result 646 states and 932 transitions. [2022-02-20 22:32:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 932 transitions. [2022-02-20 22:32:30,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:30,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:30,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:32:30,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:32:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 425 states have (on average 1.3858823529411766) internal successors, (589), 439 states have internal predecessors, (589), 109 states have call successors, (109), 38 states have call predecessors, (109), 37 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-02-20 22:32:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 806 transitions. [2022-02-20 22:32:30,412 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 806 transitions. Word has length 73 [2022-02-20 22:32:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:32:30,412 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 806 transitions. [2022-02-20 22:32:30,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:32:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 806 transitions. [2022-02-20 22:32:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:32:30,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:32:30,417 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:30,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:32:30,417 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:32:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:32:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1555888661, now seen corresponding path program 1 times [2022-02-20 22:32:30,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:32:30,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880218059] [2022-02-20 22:32:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:32:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:32:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:32:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,620 INFO L272 TraceCheckUtils]: 1: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,622 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4493#true} {4493#true} #1515#return; {4493#true} is VALID [2022-02-20 22:32:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:32:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,646 INFO L272 TraceCheckUtils]: 1: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,647 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,648 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4493#true} {4493#true} #1517#return; {4493#true} is VALID [2022-02-20 22:32:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:32:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,672 INFO L272 TraceCheckUtils]: 1: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,673 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,675 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4493#true} {4493#true} #1519#return; {4493#true} is VALID [2022-02-20 22:32:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:32:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:30,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {4565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {4493#true} is VALID [2022-02-20 22:32:30,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {4493#true} is VALID [2022-02-20 22:32:30,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {4493#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4493#true} is VALID [2022-02-20 22:32:30,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4493#true} {4493#true} #1521#return; {4493#true} is VALID [2022-02-20 22:32:30,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {4493#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {4493#true} is VALID [2022-02-20 22:32:30,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {4493#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {4493#true} is VALID [2022-02-20 22:32:30,692 INFO L272 TraceCheckUtils]: 2: Hoare triple {4493#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:30,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,693 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,693 INFO L272 TraceCheckUtils]: 9: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,695 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4493#true} {4493#true} #1515#return; {4493#true} is VALID [2022-02-20 22:32:30,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {4493#true} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {4493#true} is VALID [2022-02-20 22:32:30,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {4493#true} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:30,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,696 INFO L272 TraceCheckUtils]: 20: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,697 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,697 INFO L272 TraceCheckUtils]: 25: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,699 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4493#true} {4493#true} #1517#return; {4493#true} is VALID [2022-02-20 22:32:30,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {4493#true} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {4493#true} is VALID [2022-02-20 22:32:30,700 INFO L272 TraceCheckUtils]: 34: Hoare triple {4493#true} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:30,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {4542#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {4493#true} is VALID [2022-02-20 22:32:30,701 INFO L272 TraceCheckUtils]: 36: Hoare triple {4493#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {4550#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:30,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {4550#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4493#true} is VALID [2022-02-20 22:32:30,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,701 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4493#true} {4493#true} #1511#return; {4493#true} is VALID [2022-02-20 22:32:30,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {4493#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,701 INFO L272 TraceCheckUtils]: 41: Hoare triple {4493#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4493#true} is VALID [2022-02-20 22:32:30,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {4493#true} ~cond := #in~cond; {4493#true} is VALID [2022-02-20 22:32:30,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {4493#true} assume !(0 == ~cond); {4493#true} is VALID [2022-02-20 22:32:30,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,707 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4493#true} {4493#true} #1513#return; {4493#true} is VALID [2022-02-20 22:32:30,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {4493#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4493#true} is VALID [2022-02-20 22:32:30,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {4493#true} assume true; {4493#true} is VALID [2022-02-20 22:32:30,707 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4493#true} {4493#true} #1519#return; {4493#true} is VALID [2022-02-20 22:32:30,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {4493#true} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {4493#true} is VALID [2022-02-20 22:32:30,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {4493#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {4493#true} is VALID [2022-02-20 22:32:30,712 INFO L272 TraceCheckUtils]: 51: Hoare triple {4493#true} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {4565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:32:30,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {4565#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {4493#true} is VALID [2022-02-20 22:32:30,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {4493#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {4493#true} is VALID [2022-02-20 22:32:30,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {4493#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4493#true} is VALID [2022-02-20 22:32:30,713 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4493#true} {4493#true} #1521#return; {4493#true} is VALID [2022-02-20 22:32:30,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {4493#true} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {4493#true} is VALID [2022-02-20 22:32:30,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {4493#true} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {4493#true} is VALID [2022-02-20 22:32:30,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {4493#true} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {4541#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:32:30,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {4541#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {4541#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:32:30,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {4541#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {4541#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:32:30,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {4541#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {4541#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:32:30,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {4541#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch332#1; {4541#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:32:30,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {4541#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {4494#false} is VALID [2022-02-20 22:32:30,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {4494#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {4494#false} is VALID [2022-02-20 22:32:30,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {4494#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {4494#false} is VALID [2022-02-20 22:32:30,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {4494#false} assume main_#t~switch337#1; {4494#false} is VALID [2022-02-20 22:32:30,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {4494#false} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {4494#false} is VALID [2022-02-20 22:32:30,716 INFO L272 TraceCheckUtils]: 68: Hoare triple {4494#false} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {4494#false} is VALID [2022-02-20 22:32:30,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {4494#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {4494#false} is VALID [2022-02-20 22:32:30,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {4494#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {4494#false} is VALID [2022-02-20 22:32:30,717 INFO L272 TraceCheckUtils]: 71: Hoare triple {4494#false} call ldv_error(); {4494#false} is VALID [2022-02-20 22:32:30,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {4494#false} assume !false; {4494#false} is VALID [2022-02-20 22:32:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 22:32:30,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:32:30,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880218059] [2022-02-20 22:32:30,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880218059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:32:30,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:32:30,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:32:30,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083562816] [2022-02-20 22:32:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:32:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2022-02-20 22:32:30,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:32:30,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 22:32:30,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:30,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:32:30,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:32:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:32:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:32:30,781 INFO L87 Difference]: Start difference. First operand 572 states and 806 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 22:32:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:36,644 INFO L93 Difference]: Finished difference Result 1439 states and 2028 transitions. [2022-02-20 22:32:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:32:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2022-02-20 22:32:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:32:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 22:32:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2028 transitions. [2022-02-20 22:32:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 22:32:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2028 transitions. [2022-02-20 22:32:36,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 2028 transitions. [2022-02-20 22:32:38,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2028 edges. 2028 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:38,368 INFO L225 Difference]: With dead ends: 1439 [2022-02-20 22:32:38,368 INFO L226 Difference]: Without dead ends: 880 [2022-02-20 22:32:38,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:32:38,372 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 696 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:32:38,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2528 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 22:32:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-02-20 22:32:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 780. [2022-02-20 22:32:38,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:32:38,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 880 states. Second operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:38,406 INFO L74 IsIncluded]: Start isIncluded. First operand 880 states. Second operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:38,408 INFO L87 Difference]: Start difference. First operand 880 states. Second operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:38,457 INFO L93 Difference]: Finished difference Result 880 states and 1238 transitions. [2022-02-20 22:32:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1238 transitions. [2022-02-20 22:32:38,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:38,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:38,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 880 states. [2022-02-20 22:32:38,467 INFO L87 Difference]: Start difference. First operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 880 states. [2022-02-20 22:32:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:38,516 INFO L93 Difference]: Finished difference Result 880 states and 1238 transitions. [2022-02-20 22:32:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1238 transitions. [2022-02-20 22:32:38,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:38,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:38,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:32:38,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:32:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 584 states have (on average 1.3715753424657535) internal successors, (801), 600 states have internal predecessors, (801), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1078 transitions. [2022-02-20 22:32:38,572 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1078 transitions. Word has length 73 [2022-02-20 22:32:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:32:38,573 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1078 transitions. [2022-02-20 22:32:38,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 22:32:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1078 transitions. [2022-02-20 22:32:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 22:32:38,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:32:38,577 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:38,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:32:38,577 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:32:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:32:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1054445077, now seen corresponding path program 1 times [2022-02-20 22:32:38,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:32:38,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896251304] [2022-02-20 22:32:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:32:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:32:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:32:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,852 INFO L272 TraceCheckUtils]: 1: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,852 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,853 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9391#true} {9391#true} #1515#return; {9391#true} is VALID [2022-02-20 22:32:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:32:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,877 INFO L272 TraceCheckUtils]: 1: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,879 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9391#true} {9391#true} #1517#return; {9391#true} is VALID [2022-02-20 22:32:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:32:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,906 INFO L272 TraceCheckUtils]: 1: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,906 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,908 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9391#true} {9391#true} #1519#return; {9391#true} is VALID [2022-02-20 22:32:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:32:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {9479#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {9391#true} is VALID [2022-02-20 22:32:38,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {9391#true} is VALID [2022-02-20 22:32:38,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {9391#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9391#true} is VALID [2022-02-20 22:32:38,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9391#true} {9391#true} #1521#return; {9391#true} is VALID [2022-02-20 22:32:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:32:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:38,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,977 INFO L272 TraceCheckUtils]: 1: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,977 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,981 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9391#true} {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} #1537#return; {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:38,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {9391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {9391#true} is VALID [2022-02-20 22:32:38,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {9391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {9391#true} is VALID [2022-02-20 22:32:38,987 INFO L272 TraceCheckUtils]: 2: Hoare triple {9391#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:38,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,990 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,990 INFO L272 TraceCheckUtils]: 9: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:38,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:38,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,993 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:38,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,996 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9391#true} {9391#true} #1515#return; {9391#true} is VALID [2022-02-20 22:32:38,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {9391#true} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {9391#true} is VALID [2022-02-20 22:32:38,997 INFO L272 TraceCheckUtils]: 18: Hoare triple {9391#true} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:38,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:38,998 INFO L272 TraceCheckUtils]: 20: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:38,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:38,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:38,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:38,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:38,999 INFO L272 TraceCheckUtils]: 25: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:38,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,000 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9391#true} {9391#true} #1517#return; {9391#true} is VALID [2022-02-20 22:32:39,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {9391#true} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {9391#true} is VALID [2022-02-20 22:32:39,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {9391#true} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:39,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:39,002 INFO L272 TraceCheckUtils]: 36: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:39,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L272 TraceCheckUtils]: 41: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:39,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9391#true} {9391#true} #1519#return; {9391#true} is VALID [2022-02-20 22:32:39,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {9391#true} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {9391#true} is VALID [2022-02-20 22:32:39,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {9391#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {9391#true} is VALID [2022-02-20 22:32:39,006 INFO L272 TraceCheckUtils]: 51: Hoare triple {9391#true} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {9479#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:32:39,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {9479#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {9391#true} is VALID [2022-02-20 22:32:39,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {9391#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {9391#true} is VALID [2022-02-20 22:32:39,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {9391#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9391#true} is VALID [2022-02-20 22:32:39,006 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9391#true} {9391#true} #1521#return; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {9391#true} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {9391#true} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {9391#true} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {9391#true} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {9391#true} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {9391#true} is VALID [2022-02-20 22:32:39,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {9391#true} assume main_#t~switch332#1; {9391#true} is VALID [2022-02-20 22:32:39,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {9391#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet333#1 && main_#t~nondet333#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_#t~switch334#1 := 0 == main_~tmp___3~2#1; {9391#true} is VALID [2022-02-20 22:32:39,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {9391#true} assume !main_#t~switch334#1;main_#t~switch334#1 := main_#t~switch334#1 || 1 == main_~tmp___3~2#1; {9391#true} is VALID [2022-02-20 22:32:39,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {9391#true} assume main_#t~switch334#1; {9391#true} is VALID [2022-02-20 22:32:39,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {9391#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_rdac_init } true;havoc rdac_init_#res#1;havoc rdac_init_#t~ret318#1, rdac_init_#t~nondet319#1, rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset, rdac_init_#t~ret321#1, rdac_init_#t~nondet322#1, rdac_init_~r~0#1, rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset, rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset, rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;havoc rdac_init_~r~0#1;call rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset := #Ultimate.allocOnStack(8);havoc rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset;havoc rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;assume { :begin_inline_ldv_scsi_register_device_handler_30 } true;ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset := ~#rdac_dh~0.base, ~#rdac_dh~0.offset;havoc ldv_scsi_register_device_handler_30_#res#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1, ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset, ldv_scsi_register_device_handler_30_~ldv_func_res~4#1, ldv_scsi_register_device_handler_30_~tmp~33#1;ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset := ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset;havoc ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;havoc ldv_scsi_register_device_handler_30_~tmp~33#1;assume { :begin_inline_scsi_register_device_handler } true;scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset := ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset;havoc scsi_register_device_handler_#res#1;havoc scsi_register_device_handler_#t~nondet367#1, scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset;scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset := scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset;assume -2147483648 <= scsi_register_device_handler_#t~nondet367#1 && scsi_register_device_handler_#t~nondet367#1 <= 2147483647;scsi_register_device_handler_#res#1 := scsi_register_device_handler_#t~nondet367#1;havoc scsi_register_device_handler_#t~nondet367#1; {9391#true} is VALID [2022-02-20 22:32:39,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {9391#true} ldv_scsi_register_device_handler_30_#t~ret352#1 := scsi_register_device_handler_#res#1;assume { :end_inline_scsi_register_device_handler } true;assume -2147483648 <= ldv_scsi_register_device_handler_30_#t~ret352#1 && ldv_scsi_register_device_handler_30_#t~ret352#1 <= 2147483647;ldv_scsi_register_device_handler_30_~tmp~33#1 := ldv_scsi_register_device_handler_30_#t~ret352#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1;ldv_scsi_register_device_handler_30_~ldv_func_res~4#1 := ldv_scsi_register_device_handler_30_~tmp~33#1; {9391#true} is VALID [2022-02-20 22:32:39,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {9391#true} assume 0 == ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_scsi_device_handler_2 } true;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset, ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset;havoc ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:39,010 INFO L272 TraceCheckUtils]: 68: Hoare triple {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} call ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset := ldv_init_zalloc(3480); {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:39,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {9456#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {9391#true} is VALID [2022-02-20 22:32:39,011 INFO L272 TraceCheckUtils]: 70: Hoare triple {9391#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {9464#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:39,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {9391#true} is VALID [2022-02-20 22:32:39,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,012 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9391#true} {9391#true} #1511#return; {9391#true} is VALID [2022-02-20 22:32:39,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {9391#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {9391#true} is VALID [2022-02-20 22:32:39,012 INFO L272 TraceCheckUtils]: 75: Hoare triple {9391#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {9391#true} is VALID [2022-02-20 22:32:39,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {9391#true} ~cond := #in~cond; {9391#true} is VALID [2022-02-20 22:32:39,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {9391#true} assume !(0 == ~cond); {9391#true} is VALID [2022-02-20 22:32:39,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,013 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {9391#true} {9391#true} #1513#return; {9391#true} is VALID [2022-02-20 22:32:39,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {9391#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {9391#true} is VALID [2022-02-20 22:32:39,013 INFO L290 TraceCheckUtils]: 81: Hoare triple {9391#true} assume true; {9391#true} is VALID [2022-02-20 22:32:39,014 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9391#true} {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} #1537#return; {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:39,014 INFO L290 TraceCheckUtils]: 83: Hoare triple {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset := ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:39,015 INFO L290 TraceCheckUtils]: 84: Hoare triple {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} assume { :end_inline_ldv_scsi_device_handler_2 } true; {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:39,015 INFO L290 TraceCheckUtils]: 85: Hoare triple {9439#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} ldv_scsi_register_device_handler_30_#res#1 := ldv_scsi_register_device_handler_30_~ldv_func_res~4#1; {9454#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_#res#1| 0)} is VALID [2022-02-20 22:32:39,016 INFO L290 TraceCheckUtils]: 86: Hoare triple {9454#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_#res#1| 0)} rdac_init_#t~ret318#1 := ldv_scsi_register_device_handler_30_#res#1;assume { :end_inline_ldv_scsi_register_device_handler_30 } true;assume -2147483648 <= rdac_init_#t~ret318#1 && rdac_init_#t~ret318#1 <= 2147483647;rdac_init_~r~0#1 := rdac_init_#t~ret318#1;havoc rdac_init_#t~ret318#1; {9455#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} is VALID [2022-02-20 22:32:39,016 INFO L290 TraceCheckUtils]: 87: Hoare triple {9455#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} assume 0 != rdac_init_~r~0#1;havoc rdac_init_#t~nondet319#1; {9392#false} is VALID [2022-02-20 22:32:39,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {9392#false} rdac_init_#res#1 := rdac_init_~r~0#1;call ULTIMATE.dealloc(rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset);havoc rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset; {9392#false} is VALID [2022-02-20 22:32:39,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {9392#false} main_#t~ret335#1 := rdac_init_#res#1;assume { :end_inline_rdac_init } true;assume -2147483648 <= main_#t~ret335#1 && main_#t~ret335#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret335#1;havoc main_#t~ret335#1; {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 90: Hoare triple {9392#false} assume !(0 == ~ldv_retval_0~0); {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {9392#false} assume !(0 != ~ldv_retval_0~0); {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 92: Hoare triple {9392#false} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {9392#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 94: Hoare triple {9392#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {9392#false} is VALID [2022-02-20 22:32:39,017 INFO L290 TraceCheckUtils]: 95: Hoare triple {9392#false} assume main_#t~switch332#1; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L290 TraceCheckUtils]: 96: Hoare triple {9392#false} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L290 TraceCheckUtils]: 97: Hoare triple {9392#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L290 TraceCheckUtils]: 98: Hoare triple {9392#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L290 TraceCheckUtils]: 99: Hoare triple {9392#false} assume main_#t~switch337#1; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L290 TraceCheckUtils]: 100: Hoare triple {9392#false} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {9392#false} is VALID [2022-02-20 22:32:39,018 INFO L272 TraceCheckUtils]: 101: Hoare triple {9392#false} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {9392#false} is VALID [2022-02-20 22:32:39,019 INFO L290 TraceCheckUtils]: 102: Hoare triple {9392#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {9392#false} is VALID [2022-02-20 22:32:39,019 INFO L290 TraceCheckUtils]: 103: Hoare triple {9392#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {9392#false} is VALID [2022-02-20 22:32:39,019 INFO L272 TraceCheckUtils]: 104: Hoare triple {9392#false} call ldv_error(); {9392#false} is VALID [2022-02-20 22:32:39,019 INFO L290 TraceCheckUtils]: 105: Hoare triple {9392#false} assume !false; {9392#false} is VALID [2022-02-20 22:32:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 22:32:39,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:32:39,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896251304] [2022-02-20 22:32:39,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896251304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:32:39,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:32:39,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 22:32:39,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017538734] [2022-02-20 22:32:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:32:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2022-02-20 22:32:39,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:32:39,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:39,095 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 22:32:39,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 22:32:39,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:32:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 22:32:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 22:32:39,097 INFO L87 Difference]: Start difference. First operand 780 states and 1078 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:48,529 INFO L93 Difference]: Finished difference Result 2211 states and 3238 transitions. [2022-02-20 22:32:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 22:32:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2022-02-20 22:32:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:32:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2562 transitions. [2022-02-20 22:32:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2562 transitions. [2022-02-20 22:32:48,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 2562 transitions. [2022-02-20 22:32:50,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2562 edges. 2562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:50,875 INFO L225 Difference]: With dead ends: 2211 [2022-02-20 22:32:50,875 INFO L226 Difference]: Without dead ends: 1454 [2022-02-20 22:32:50,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:32:50,879 INFO L933 BasicCegarLoop]: 1190 mSDtfsCounter, 1500 mSDsluCounter, 3781 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 4971 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 22:32:50,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 4971 Invalid, 1985 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [556 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 22:32:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-02-20 22:32:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 783. [2022-02-20 22:32:50,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:32:50,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1454 states. Second operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:50,920 INFO L74 IsIncluded]: Start isIncluded. First operand 1454 states. Second operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:50,923 INFO L87 Difference]: Start difference. First operand 1454 states. Second operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:51,028 INFO L93 Difference]: Finished difference Result 1454 states and 2186 transitions. [2022-02-20 22:32:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2186 transitions. [2022-02-20 22:32:51,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:51,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:51,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1454 states. [2022-02-20 22:32:51,041 INFO L87 Difference]: Start difference. First operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1454 states. [2022-02-20 22:32:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:32:51,177 INFO L93 Difference]: Finished difference Result 1454 states and 2186 transitions. [2022-02-20 22:32:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2186 transitions. [2022-02-20 22:32:51,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:32:51,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:32:51,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:32:51,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:32:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 587 states have (on average 1.3696763202725724) internal successors, (804), 603 states have internal predecessors, (804), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:32:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1081 transitions. [2022-02-20 22:32:51,241 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1081 transitions. Word has length 106 [2022-02-20 22:32:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:32:51,243 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1081 transitions. [2022-02-20 22:32:51,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1081 transitions. [2022-02-20 22:32:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 22:32:51,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:32:51,250 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:51,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:32:51,251 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:32:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:32:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1710414679, now seen corresponding path program 1 times [2022-02-20 22:32:51,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:32:51,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126271959] [2022-02-20 22:32:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:32:51,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:32:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:32:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,478 INFO L272 TraceCheckUtils]: 1: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,478 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,480 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16490#true} {16490#true} #1515#return; {16490#true} is VALID [2022-02-20 22:32:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:32:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,522 INFO L272 TraceCheckUtils]: 1: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,522 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,524 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16490#true} {16490#true} #1517#return; {16490#true} is VALID [2022-02-20 22:32:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:32:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,561 INFO L272 TraceCheckUtils]: 1: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,561 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,563 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16490#true} {16490#true} #1519#return; {16490#true} is VALID [2022-02-20 22:32:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:32:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {16580#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {16490#true} is VALID [2022-02-20 22:32:51,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {16490#true} is VALID [2022-02-20 22:32:51,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {16490#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16490#true} is VALID [2022-02-20 22:32:51,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16490#true} {16490#true} #1521#return; {16490#true} is VALID [2022-02-20 22:32:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:32:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:32:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:32:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:32:51,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,614 INFO L272 TraceCheckUtils]: 1: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,616 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16490#true} {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} #1537#return; {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:51,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {16490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {16490#true} is VALID [2022-02-20 22:32:51,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {16490#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {16490#true} is VALID [2022-02-20 22:32:51,618 INFO L272 TraceCheckUtils]: 2: Hoare triple {16490#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:51,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L272 TraceCheckUtils]: 9: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16490#true} {16490#true} #1515#return; {16490#true} is VALID [2022-02-20 22:32:51,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {16490#true} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {16490#true} is VALID [2022-02-20 22:32:51,621 INFO L272 TraceCheckUtils]: 18: Hoare triple {16490#true} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:51,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,622 INFO L272 TraceCheckUtils]: 20: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,622 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L272 TraceCheckUtils]: 25: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,624 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16490#true} {16490#true} #1517#return; {16490#true} is VALID [2022-02-20 22:32:51,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {16490#true} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {16490#true} is VALID [2022-02-20 22:32:51,624 INFO L272 TraceCheckUtils]: 34: Hoare triple {16490#true} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:51,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,625 INFO L272 TraceCheckUtils]: 36: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,626 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,626 INFO L272 TraceCheckUtils]: 41: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16490#true} {16490#true} #1519#return; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {16490#true} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {16490#true} is VALID [2022-02-20 22:32:51,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {16490#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {16490#true} is VALID [2022-02-20 22:32:51,629 INFO L272 TraceCheckUtils]: 51: Hoare triple {16490#true} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {16580#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:32:51,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {16580#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {16490#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 54: Hoare triple {16490#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16490#true} {16490#true} #1521#return; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {16490#true} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {16490#true} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {16490#true} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {16490#true} is VALID [2022-02-20 22:32:51,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {16490#true} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 60: Hoare triple {16490#true} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {16490#true} assume main_#t~switch332#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {16490#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet333#1 && main_#t~nondet333#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_#t~switch334#1 := 0 == main_~tmp___3~2#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {16490#true} assume !main_#t~switch334#1;main_#t~switch334#1 := main_#t~switch334#1 || 1 == main_~tmp___3~2#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {16490#true} assume main_#t~switch334#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {16490#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_rdac_init } true;havoc rdac_init_#res#1;havoc rdac_init_#t~ret318#1, rdac_init_#t~nondet319#1, rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset, rdac_init_#t~ret321#1, rdac_init_#t~nondet322#1, rdac_init_~r~0#1, rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset, rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset, rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;havoc rdac_init_~r~0#1;call rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset := #Ultimate.allocOnStack(8);havoc rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset;havoc rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;assume { :begin_inline_ldv_scsi_register_device_handler_30 } true;ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset := ~#rdac_dh~0.base, ~#rdac_dh~0.offset;havoc ldv_scsi_register_device_handler_30_#res#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1, ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset, ldv_scsi_register_device_handler_30_~ldv_func_res~4#1, ldv_scsi_register_device_handler_30_~tmp~33#1;ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset := ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset;havoc ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;havoc ldv_scsi_register_device_handler_30_~tmp~33#1;assume { :begin_inline_scsi_register_device_handler } true;scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset := ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset;havoc scsi_register_device_handler_#res#1;havoc scsi_register_device_handler_#t~nondet367#1, scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset;scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset := scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset;assume -2147483648 <= scsi_register_device_handler_#t~nondet367#1 && scsi_register_device_handler_#t~nondet367#1 <= 2147483647;scsi_register_device_handler_#res#1 := scsi_register_device_handler_#t~nondet367#1;havoc scsi_register_device_handler_#t~nondet367#1; {16490#true} is VALID [2022-02-20 22:32:51,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {16490#true} ldv_scsi_register_device_handler_30_#t~ret352#1 := scsi_register_device_handler_#res#1;assume { :end_inline_scsi_register_device_handler } true;assume -2147483648 <= ldv_scsi_register_device_handler_30_#t~ret352#1 && ldv_scsi_register_device_handler_30_#t~ret352#1 <= 2147483647;ldv_scsi_register_device_handler_30_~tmp~33#1 := ldv_scsi_register_device_handler_30_#t~ret352#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1;ldv_scsi_register_device_handler_30_~ldv_func_res~4#1 := ldv_scsi_register_device_handler_30_~tmp~33#1; {16490#true} is VALID [2022-02-20 22:32:51,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {16490#true} assume 0 == ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_scsi_device_handler_2 } true;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset, ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset;havoc ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:51,632 INFO L272 TraceCheckUtils]: 68: Hoare triple {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} call ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset := ldv_init_zalloc(3480); {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:32:51,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {16557#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {16490#true} is VALID [2022-02-20 22:32:51,633 INFO L272 TraceCheckUtils]: 70: Hoare triple {16490#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {16565#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 71: Hoare triple {16565#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 72: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16490#true} {16490#true} #1511#return; {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {16490#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L272 TraceCheckUtils]: 75: Hoare triple {16490#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {16490#true} ~cond := #in~cond; {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {16490#true} assume !(0 == ~cond); {16490#true} is VALID [2022-02-20 22:32:51,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,635 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16490#true} {16490#true} #1513#return; {16490#true} is VALID [2022-02-20 22:32:51,635 INFO L290 TraceCheckUtils]: 80: Hoare triple {16490#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {16490#true} is VALID [2022-02-20 22:32:51,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {16490#true} assume true; {16490#true} is VALID [2022-02-20 22:32:51,636 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16490#true} {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} #1537#return; {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:51,636 INFO L290 TraceCheckUtils]: 83: Hoare triple {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset := ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:51,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} assume { :end_inline_ldv_scsi_device_handler_2 } true; {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} is VALID [2022-02-20 22:32:51,637 INFO L290 TraceCheckUtils]: 85: Hoare triple {16538#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_~ldv_func_res~4#1| 0)} ldv_scsi_register_device_handler_30_#res#1 := ldv_scsi_register_device_handler_30_~ldv_func_res~4#1; {16553#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_#res#1| 0)} is VALID [2022-02-20 22:32:51,637 INFO L290 TraceCheckUtils]: 86: Hoare triple {16553#(= |ULTIMATE.start_ldv_scsi_register_device_handler_30_#res#1| 0)} rdac_init_#t~ret318#1 := ldv_scsi_register_device_handler_30_#res#1;assume { :end_inline_ldv_scsi_register_device_handler_30 } true;assume -2147483648 <= rdac_init_#t~ret318#1 && rdac_init_#t~ret318#1 <= 2147483647;rdac_init_~r~0#1 := rdac_init_#t~ret318#1;havoc rdac_init_#t~ret318#1; {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} is VALID [2022-02-20 22:32:51,637 INFO L290 TraceCheckUtils]: 87: Hoare triple {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} assume !(0 != rdac_init_~r~0#1);rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset := 80, 0;havoc rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset := rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset; {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} is VALID [2022-02-20 22:32:51,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} assume !(0 == (~kmpath_rdacd~0.base + ~kmpath_rdacd~0.offset) % 18446744073709551616); {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} is VALID [2022-02-20 22:32:51,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {16554#(= |ULTIMATE.start_rdac_init_~r~0#1| 0)} rdac_init_#res#1 := rdac_init_~r~0#1;call ULTIMATE.dealloc(rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset);havoc rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset; {16555#(= |ULTIMATE.start_rdac_init_#res#1| 0)} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {16555#(= |ULTIMATE.start_rdac_init_#res#1| 0)} main_#t~ret335#1 := rdac_init_#res#1;assume { :end_inline_rdac_init } true;assume -2147483648 <= main_#t~ret335#1 && main_#t~ret335#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret335#1;havoc main_#t~ret335#1; {16556#(= ~ldv_retval_0~0 0)} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {16556#(= ~ldv_retval_0~0 0)} assume !(0 == ~ldv_retval_0~0); {16491#false} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {16491#false} assume !(0 != ~ldv_retval_0~0); {16491#false} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {16491#false} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {16491#false} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {16491#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {16491#false} is VALID [2022-02-20 22:32:51,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {16491#false} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 96: Hoare triple {16491#false} assume main_#t~switch332#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 97: Hoare triple {16491#false} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 98: Hoare triple {16491#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 99: Hoare triple {16491#false} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {16491#false} assume main_#t~switch337#1; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {16491#false} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {16491#false} is VALID [2022-02-20 22:32:51,640 INFO L272 TraceCheckUtils]: 102: Hoare triple {16491#false} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {16491#false} is VALID [2022-02-20 22:32:51,641 INFO L290 TraceCheckUtils]: 103: Hoare triple {16491#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {16491#false} is VALID [2022-02-20 22:32:51,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {16491#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {16491#false} is VALID [2022-02-20 22:32:51,641 INFO L272 TraceCheckUtils]: 105: Hoare triple {16491#false} call ldv_error(); {16491#false} is VALID [2022-02-20 22:32:51,641 INFO L290 TraceCheckUtils]: 106: Hoare triple {16491#false} assume !false; {16491#false} is VALID [2022-02-20 22:32:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 22:32:51,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:32:51,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126271959] [2022-02-20 22:32:51,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126271959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:32:51,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:32:51,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 22:32:51,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961330252] [2022-02-20 22:32:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:32:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-02-20 22:32:51,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:32:51,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:32:51,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:32:51,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 22:32:51,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:32:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 22:32:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 22:32:51,714 INFO L87 Difference]: Start difference. First operand 783 states and 1081 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:02,499 INFO L93 Difference]: Finished difference Result 2217 states and 3243 transitions. [2022-02-20 22:33:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 22:33:02,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-02-20 22:33:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:33:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2563 transitions. [2022-02-20 22:33:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2563 transitions. [2022-02-20 22:33:02,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 2563 transitions. [2022-02-20 22:33:04,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2563 edges. 2563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:33:04,791 INFO L225 Difference]: With dead ends: 2217 [2022-02-20 22:33:04,791 INFO L226 Difference]: Without dead ends: 1457 [2022-02-20 22:33:04,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-20 22:33:04,795 INFO L933 BasicCegarLoop]: 1143 mSDtfsCounter, 2813 mSDsluCounter, 3705 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 1124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 4848 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1124 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:33:04,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2880 Valid, 4848 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1124 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-02-20 22:33:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-02-20 22:33:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 789. [2022-02-20 22:33:04,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:33:04,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1457 states. Second operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:33:04,832 INFO L74 IsIncluded]: Start isIncluded. First operand 1457 states. Second operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:33:04,834 INFO L87 Difference]: Start difference. First operand 1457 states. Second operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:33:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:04,935 INFO L93 Difference]: Finished difference Result 1457 states and 2186 transitions. [2022-02-20 22:33:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2186 transitions. [2022-02-20 22:33:04,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:33:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:33:04,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1457 states. [2022-02-20 22:33:04,948 INFO L87 Difference]: Start difference. First operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) Second operand 1457 states. [2022-02-20 22:33:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:05,049 INFO L93 Difference]: Finished difference Result 1457 states and 2186 transitions. [2022-02-20 22:33:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2186 transitions. [2022-02-20 22:33:05,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:33:05,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:33:05,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:33:05,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:33:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 593 states have (on average 1.3659359190556493) internal successors, (810), 609 states have internal predecessors, (810), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2022-02-20 22:33:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1087 transitions. [2022-02-20 22:33:05,113 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1087 transitions. Word has length 107 [2022-02-20 22:33:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:33:05,114 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1087 transitions. [2022-02-20 22:33:05,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1087 transitions. [2022-02-20 22:33:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 22:33:05,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:33:05,116 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:05,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 22:33:05,116 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:33:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:33:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1563484263, now seen corresponding path program 1 times [2022-02-20 22:33:05,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:33:05,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280090538] [2022-02-20 22:33:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:33:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:33:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:33:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,265 INFO L272 TraceCheckUtils]: 1: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,267 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1515#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:33:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,290 INFO L272 TraceCheckUtils]: 1: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,290 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,292 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1517#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:33:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,317 INFO L272 TraceCheckUtils]: 1: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,317 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,319 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1519#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:33:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {23714#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {23628#true} is VALID [2022-02-20 22:33:05,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {23628#true} is VALID [2022-02-20 22:33:05,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {23628#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {23628#true} is VALID [2022-02-20 22:33:05,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1521#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:33:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:05,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,362 INFO L272 TraceCheckUtils]: 1: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,364 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1537#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {23628#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {23630#(= ~ldv_spin~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,366 INFO L272 TraceCheckUtils]: 2: Hoare triple {23630#(= ~ldv_spin~0 0)} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:05,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L272 TraceCheckUtils]: 9: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1515#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {23630#(= ~ldv_spin~0 0)} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {23630#(= ~ldv_spin~0 0)} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:05,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,371 INFO L272 TraceCheckUtils]: 20: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,371 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L272 TraceCheckUtils]: 25: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,376 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1517#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {23630#(= ~ldv_spin~0 0)} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,377 INFO L272 TraceCheckUtils]: 34: Hoare triple {23630#(= ~ldv_spin~0 0)} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:05,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,378 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L272 TraceCheckUtils]: 41: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,380 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1519#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {23630#(= ~ldv_spin~0 0)} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {23630#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,382 INFO L272 TraceCheckUtils]: 51: Hoare triple {23630#(= ~ldv_spin~0 0)} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {23714#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:33:05,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {23714#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {23628#true} is VALID [2022-02-20 22:33:05,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {23628#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {23628#true} is VALID [2022-02-20 22:33:05,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {23628#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {23628#true} is VALID [2022-02-20 22:33:05,383 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1521#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {23630#(= ~ldv_spin~0 0)} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {23630#(= ~ldv_spin~0 0)} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {23630#(= ~ldv_spin~0 0)} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {23630#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,385 INFO L290 TraceCheckUtils]: 60: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {23630#(= ~ldv_spin~0 0)} assume main_#t~switch332#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet333#1 && main_#t~nondet333#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_#t~switch334#1 := 0 == main_~tmp___3~2#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,387 INFO L290 TraceCheckUtils]: 63: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch334#1;main_#t~switch334#1 := main_#t~switch334#1 || 1 == main_~tmp___3~2#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {23630#(= ~ldv_spin~0 0)} assume main_#t~switch334#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_rdac_init } true;havoc rdac_init_#res#1;havoc rdac_init_#t~ret318#1, rdac_init_#t~nondet319#1, rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset, rdac_init_#t~ret321#1, rdac_init_#t~nondet322#1, rdac_init_~r~0#1, rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset, rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset, rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;havoc rdac_init_~r~0#1;call rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset := #Ultimate.allocOnStack(8);havoc rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset;havoc rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;assume { :begin_inline_ldv_scsi_register_device_handler_30 } true;ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset := ~#rdac_dh~0.base, ~#rdac_dh~0.offset;havoc ldv_scsi_register_device_handler_30_#res#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1, ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset, ldv_scsi_register_device_handler_30_~ldv_func_res~4#1, ldv_scsi_register_device_handler_30_~tmp~33#1;ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset := ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset;havoc ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;havoc ldv_scsi_register_device_handler_30_~tmp~33#1;assume { :begin_inline_scsi_register_device_handler } true;scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset := ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset;havoc scsi_register_device_handler_#res#1;havoc scsi_register_device_handler_#t~nondet367#1, scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset;scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset := scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset;assume -2147483648 <= scsi_register_device_handler_#t~nondet367#1 && scsi_register_device_handler_#t~nondet367#1 <= 2147483647;scsi_register_device_handler_#res#1 := scsi_register_device_handler_#t~nondet367#1;havoc scsi_register_device_handler_#t~nondet367#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {23630#(= ~ldv_spin~0 0)} ldv_scsi_register_device_handler_30_#t~ret352#1 := scsi_register_device_handler_#res#1;assume { :end_inline_scsi_register_device_handler } true;assume -2147483648 <= ldv_scsi_register_device_handler_30_#t~ret352#1 && ldv_scsi_register_device_handler_30_#t~ret352#1 <= 2147483647;ldv_scsi_register_device_handler_30_~tmp~33#1 := ldv_scsi_register_device_handler_30_#t~ret352#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1;ldv_scsi_register_device_handler_30_~ldv_func_res~4#1 := ldv_scsi_register_device_handler_30_~tmp~33#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 0 == ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_scsi_device_handler_2 } true;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset, ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset;havoc ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,389 INFO L272 TraceCheckUtils]: 68: Hoare triple {23630#(= ~ldv_spin~0 0)} call ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset := ldv_init_zalloc(3480); {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:05,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {23691#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {23628#true} is VALID [2022-02-20 22:33:05,390 INFO L272 TraceCheckUtils]: 70: Hoare triple {23628#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {23699#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:05,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {23699#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {23628#true} is VALID [2022-02-20 22:33:05,390 INFO L290 TraceCheckUtils]: 72: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,390 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {23628#true} {23628#true} #1511#return; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 74: Hoare triple {23628#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L272 TraceCheckUtils]: 75: Hoare triple {23628#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 76: Hoare triple {23628#true} ~cond := #in~cond; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 77: Hoare triple {23628#true} assume !(0 == ~cond); {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 78: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23628#true} {23628#true} #1513#return; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 80: Hoare triple {23628#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {23628#true} is VALID [2022-02-20 22:33:05,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {23628#true} assume true; {23628#true} is VALID [2022-02-20 22:33:05,392 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23628#true} {23630#(= ~ldv_spin~0 0)} #1537#return; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {23630#(= ~ldv_spin~0 0)} ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset := ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {23630#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_scsi_device_handler_2 } true; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {23630#(= ~ldv_spin~0 0)} ldv_scsi_register_device_handler_30_#res#1 := ldv_scsi_register_device_handler_30_~ldv_func_res~4#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,394 INFO L290 TraceCheckUtils]: 86: Hoare triple {23630#(= ~ldv_spin~0 0)} rdac_init_#t~ret318#1 := ldv_scsi_register_device_handler_30_#res#1;assume { :end_inline_ldv_scsi_register_device_handler_30 } true;assume -2147483648 <= rdac_init_#t~ret318#1 && rdac_init_#t~ret318#1 <= 2147483647;rdac_init_~r~0#1 := rdac_init_#t~ret318#1;havoc rdac_init_#t~ret318#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !(0 != rdac_init_~r~0#1);rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset := 80, 0;havoc rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset := rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !(0 == (~kmpath_rdacd~0.base + ~kmpath_rdacd~0.offset) % 18446744073709551616); {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {23630#(= ~ldv_spin~0 0)} rdac_init_#res#1 := rdac_init_~r~0#1;call ULTIMATE.dealloc(rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset);havoc rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,395 INFO L290 TraceCheckUtils]: 90: Hoare triple {23630#(= ~ldv_spin~0 0)} main_#t~ret335#1 := rdac_init_#res#1;assume { :end_inline_rdac_init } true;assume -2147483648 <= main_#t~ret335#1 && main_#t~ret335#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret335#1;havoc main_#t~ret335#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !(0 != ~ldv_retval_0~0); {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {23630#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,397 INFO L290 TraceCheckUtils]: 94: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,397 INFO L290 TraceCheckUtils]: 95: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {23630#(= ~ldv_spin~0 0)} assume main_#t~switch332#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,398 INFO L290 TraceCheckUtils]: 97: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,399 INFO L290 TraceCheckUtils]: 98: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,399 INFO L290 TraceCheckUtils]: 99: Hoare triple {23630#(= ~ldv_spin~0 0)} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,399 INFO L290 TraceCheckUtils]: 100: Hoare triple {23630#(= ~ldv_spin~0 0)} assume main_#t~switch337#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,400 INFO L290 TraceCheckUtils]: 101: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,400 INFO L272 TraceCheckUtils]: 102: Hoare triple {23630#(= ~ldv_spin~0 0)} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,401 INFO L290 TraceCheckUtils]: 103: Hoare triple {23630#(= ~ldv_spin~0 0)} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {23630#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:33:05,401 INFO L290 TraceCheckUtils]: 104: Hoare triple {23630#(= ~ldv_spin~0 0)} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {23629#false} is VALID [2022-02-20 22:33:05,401 INFO L272 TraceCheckUtils]: 105: Hoare triple {23629#false} call ldv_error(); {23629#false} is VALID [2022-02-20 22:33:05,401 INFO L290 TraceCheckUtils]: 106: Hoare triple {23629#false} assume !false; {23629#false} is VALID [2022-02-20 22:33:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-02-20 22:33:05,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:33:05,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280090538] [2022-02-20 22:33:05,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280090538] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:33:05,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:33:05,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:33:05,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844658592] [2022-02-20 22:33:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:33:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-02-20 22:33:05,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:33:05,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:05,473 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 22:33:05,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:33:05,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:33:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:33:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:33:05,474 INFO L87 Difference]: Start difference. First operand 789 states and 1087 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:09,615 INFO L93 Difference]: Finished difference Result 994 states and 1381 transitions. [2022-02-20 22:33:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:33:09,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-02-20 22:33:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:33:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1071 transitions. [2022-02-20 22:33:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1071 transitions. [2022-02-20 22:33:09,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1071 transitions. [2022-02-20 22:33:10,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1071 edges. 1071 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:33:10,659 INFO L225 Difference]: With dead ends: 994 [2022-02-20 22:33:10,659 INFO L226 Difference]: Without dead ends: 991 [2022-02-20 22:33:10,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:33:10,661 INFO L933 BasicCegarLoop]: 786 mSDtfsCounter, 1035 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:33:10,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1079 Valid, 1726 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 22:33:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-02-20 22:33:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 877. [2022-02-20 22:33:10,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:33:10,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 991 states. Second operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) [2022-02-20 22:33:10,715 INFO L74 IsIncluded]: Start isIncluded. First operand 991 states. Second operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) [2022-02-20 22:33:10,718 INFO L87 Difference]: Start difference. First operand 991 states. Second operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) [2022-02-20 22:33:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:10,771 INFO L93 Difference]: Finished difference Result 991 states and 1378 transitions. [2022-02-20 22:33:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1378 transitions. [2022-02-20 22:33:10,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:33:10,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:33:10,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) Second operand 991 states. [2022-02-20 22:33:10,781 INFO L87 Difference]: Start difference. First operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) Second operand 991 states. [2022-02-20 22:33:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:33:10,834 INFO L93 Difference]: Finished difference Result 991 states and 1378 transitions. [2022-02-20 22:33:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1378 transitions. [2022-02-20 22:33:10,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:33:10,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:33:10,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:33:10,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:33:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 646 states have (on average 1.3606811145510835) internal successors, (879), 674 states have internal predecessors, (879), 159 states have call successors, (159), 72 states have call predecessors, (159), 71 states have return successors, (171), 152 states have call predecessors, (171), 158 states have call successors, (171) [2022-02-20 22:33:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1209 transitions. [2022-02-20 22:33:10,895 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1209 transitions. Word has length 107 [2022-02-20 22:33:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:33:10,896 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1209 transitions. [2022-02-20 22:33:10,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:33:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1209 transitions. [2022-02-20 22:33:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-02-20 22:33:10,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:33:10,901 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:10,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 22:33:10,901 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:33:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:33:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1961629115, now seen corresponding path program 1 times [2022-02-20 22:33:10,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:33:10,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446758119] [2022-02-20 22:33:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:33:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:33:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:33:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,138 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,140 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1515#return; {28301#true} is VALID [2022-02-20 22:33:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:33:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,162 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,164 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1517#return; {28301#true} is VALID [2022-02-20 22:33:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:33:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,189 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,189 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,190 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1519#return; {28301#true} is VALID [2022-02-20 22:33:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:33:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {28462#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {28301#true} is VALID [2022-02-20 22:33:11,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {28301#true} is VALID [2022-02-20 22:33:11,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {28301#true} is VALID [2022-02-20 22:33:11,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1521#return; {28301#true} is VALID [2022-02-20 22:33:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:33:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:33:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,226 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,226 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,227 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1537#return; {28301#true} is VALID [2022-02-20 22:33:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-20 22:33:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:33:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1473#return; {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume !(0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296); {28301#true} is VALID [2022-02-20 22:33:11,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume { :end_inline_ldv_check_alloc_flags } true; {28301#true} is VALID [2022-02-20 22:33:11,250 INFO L272 TraceCheckUtils]: 3: Hoare triple {28301#true} call #t~ret351#1.base, #t~ret351#1.offset := ldv_malloc(~size#1); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,251 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1473#return; {28301#true} is VALID [2022-02-20 22:33:11,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} ~tmp~32#1.base, ~tmp~32#1.offset := #t~ret351#1.base, #t~ret351#1.offset;havoc #t~ret351#1.base, #t~ret351#1.offset;#res#1.base, #res#1.offset := ~tmp~32#1.base, ~tmp~32#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28301#true} {28301#true} #1565#return; {28301#true} is VALID [2022-02-20 22:33:11,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-02-20 22:33:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:33:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,305 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,306 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,307 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,307 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L272 TraceCheckUtils]: 8: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,308 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,309 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev.base, ~sdev.offset := #in~sdev.base, #in~sdev.offset;~page_code := #in~page_code;~len := #in~len;~h.base, ~h.offset := #in~h.base, #in~h.offset;havoc ~rq~2.base, ~rq~2.offset;havoc ~q~1.base, ~q~1.offset;havoc ~err~0;call #t~mem153.base, #t~mem153.offset := read~$Pointer$(~sdev.base, 8 + ~sdev.offset, 8);~q~1.base, ~q~1.offset := #t~mem153.base, #t~mem153.offset;havoc #t~mem153.base, #t~mem153.offset;~err~0 := 13; {28301#true} is VALID [2022-02-20 22:33:11,311 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #t~ret154.base, #t~ret154.offset := get_rdac_req(~sdev.base, ~sdev.offset, ~h.base, 132 + ~h.offset, ~len, 0); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,312 INFO L272 TraceCheckUtils]: 3: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,312 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L272 TraceCheckUtils]: 10: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L272 TraceCheckUtils]: 12: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,314 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {28301#true} ~rq~2.base, ~rq~2.offset := #t~ret154.base, #t~ret154.offset;havoc #t~ret154.base, #t~ret154.offset; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {28301#true} assume 0 == (~rq~2.base + ~rq~2.offset) % 18446744073709551616; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {28301#true} #res := ~err~0; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {28301#true} {28301#true} #1569#return; {28301#true} is VALID [2022-02-20 22:33:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-02-20 22:33:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:33:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:33:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,386 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,386 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L272 TraceCheckUtils]: 8: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,389 INFO L272 TraceCheckUtils]: 10: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev.base, ~sdev.offset := #in~sdev.base, #in~sdev.offset;~page_code := #in~page_code;~len := #in~len;~h.base, ~h.offset := #in~h.base, #in~h.offset;havoc ~rq~2.base, ~rq~2.offset;havoc ~q~1.base, ~q~1.offset;havoc ~err~0;call #t~mem153.base, #t~mem153.offset := read~$Pointer$(~sdev.base, 8 + ~sdev.offset, 8);~q~1.base, ~q~1.offset := #t~mem153.base, #t~mem153.offset;havoc #t~mem153.base, #t~mem153.offset;~err~0 := 13; {28301#true} is VALID [2022-02-20 22:33:11,392 INFO L272 TraceCheckUtils]: 1: Hoare triple {28301#true} call #t~ret154.base, #t~ret154.offset := get_rdac_req(~sdev.base, ~sdev.offset, ~h.base, 132 + ~h.offset, ~len, 0); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,393 INFO L272 TraceCheckUtils]: 3: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,393 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L272 TraceCheckUtils]: 10: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {28301#true} ~rq~2.base, ~rq~2.offset := #t~ret154.base, #t~ret154.offset;havoc #t~ret154.base, #t~ret154.offset; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {28301#true} assume 0 == (~rq~2.base + ~rq~2.offset) % 18446744073709551616; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {28301#true} #res := ~err~0; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,396 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {28301#true} {28302#false} #1575#return; {28302#false} is VALID [2022-02-20 22:33:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-02-20 22:33:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:33:11,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {28548#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~lock#1.base, ~lock#1.offset := #in~lock#1.base, #in~lock#1.offset;assume { :begin_inline_ldv_spin_lock } true;~ldv_spin~0 := 1; {28301#true} is VALID [2022-02-20 22:33:11,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume { :end_inline_ldv_spin_lock } true;assume { :begin_inline_ldv_spin_lock_5 } true;ldv_spin_lock_5_#in~lock#1.base, ldv_spin_lock_5_#in~lock#1.offset := ~lock#1.base, ~lock#1.offset;havoc ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset;ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset := ldv_spin_lock_5_#in~lock#1.base, ldv_spin_lock_5_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {28301#true} assume { :end_inline__raw_spin_lock } true; {28301#true} is VALID [2022-02-20 22:33:11,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {28301#true} assume { :end_inline_ldv_spin_lock_5 } true; {28301#true} is VALID [2022-02-20 22:33:11,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,410 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28301#true} {28302#false} #1577#return; {28302#false} is VALID [2022-02-20 22:33:11,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {28301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(96, 2);call #Ultimate.allocInit(21, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(5, 5);call write~init~int(82, 5, 0, 1);call write~init~int(68, 5, 1, 1);call write~init~int(65, 5, 2, 1);call write~init~int(67, 5, 3, 1);call write~init~int(0, 5, 4, 1);call #Ultimate.allocInit(4, 6);call write~init~int(65, 6, 0, 1);call write~init~int(86, 6, 1, 1);call write~init~int(84, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(73, 7, 0, 1);call write~init~int(79, 7, 1, 1);call write~init~int(83, 7, 2, 1);call write~init~int(72, 7, 3, 1);call write~init~int(73, 7, 4, 1);call write~init~int(80, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(8, 8);call #Ultimate.allocInit(6, 9);call write~init~int(111, 9, 0, 1);call write~init~int(119, 9, 1, 1);call write~init~int(110, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(0, 9, 5, 1);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(2, 11);call write~init~int(14, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(39, 12);call #Ultimate.allocInit(2, 13);call write~init~int(14, 13, 0, 1);call write~init~int(0, 13, 1, 1);call #Ultimate.allocInit(39, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(17, 16);call #Ultimate.allocInit(2, 17);call write~init~int(14, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(2, 19);call write~init~int(14, 19, 0, 1);call write~init~int(0, 19, 1, 1);call #Ultimate.allocInit(49, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(9, 22);call #Ultimate.allocInit(2, 23);call write~init~int(14, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(48, 24);call #Ultimate.allocInit(2, 25);call write~init~int(14, 25, 0, 1);call write~init~int(0, 25, 1, 1);call #Ultimate.allocInit(65, 26);call #Ultimate.allocInit(4, 27);call write~init~int(73, 27, 0, 1);call write~init~int(66, 27, 1, 1);call write~init~int(77, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(5, 28);call write~init~int(49, 28, 0, 1);call write~init~int(55, 28, 1, 1);call write~init~int(50, 28, 2, 1);call write~init~int(50, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(4, 29);call write~init~int(73, 29, 0, 1);call write~init~int(66, 29, 1, 1);call write~init~int(77, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(5, 30);call write~init~int(49, 30, 0, 1);call write~init~int(55, 30, 1, 1);call write~init~int(50, 30, 2, 1);call write~init~int(52, 30, 3, 1);call write~init~int(0, 30, 4, 1);call #Ultimate.allocInit(4, 31);call write~init~int(73, 31, 0, 1);call write~init~int(66, 31, 1, 1);call write~init~int(77, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(5, 32);call write~init~int(49, 32, 0, 1);call write~init~int(55, 32, 1, 1);call write~init~int(50, 32, 2, 1);call write~init~int(54, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(4, 33);call write~init~int(73, 33, 0, 1);call write~init~int(66, 33, 1, 1);call write~init~int(77, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(5, 34);call write~init~int(49, 34, 0, 1);call write~init~int(55, 34, 1, 1);call write~init~int(52, 34, 2, 1);call write~init~int(50, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(4, 35);call write~init~int(73, 35, 0, 1);call write~init~int(66, 35, 1, 1);call write~init~int(77, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(5, 36);call write~init~int(49, 36, 0, 1);call write~init~int(55, 36, 1, 1);call write~init~int(52, 36, 2, 1);call write~init~int(53, 36, 3, 1);call write~init~int(0, 36, 4, 1);call #Ultimate.allocInit(4, 37);call write~init~int(73, 37, 0, 1);call write~init~int(66, 37, 1, 1);call write~init~int(77, 37, 2, 1);call write~init~int(0, 37, 3, 1);call #Ultimate.allocInit(5, 38);call write~init~int(49, 38, 0, 1);call write~init~int(55, 38, 1, 1);call write~init~int(52, 38, 2, 1);call write~init~int(54, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(4, 39);call write~init~int(73, 39, 0, 1);call write~init~int(66, 39, 1, 1);call write~init~int(77, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(5, 40);call write~init~int(49, 40, 0, 1);call write~init~int(56, 40, 1, 1);call write~init~int(49, 40, 2, 1);call write~init~int(51, 40, 3, 1);call write~init~int(0, 40, 4, 1);call #Ultimate.allocInit(4, 41);call write~init~int(73, 41, 0, 1);call write~init~int(66, 41, 1, 1);call write~init~int(77, 41, 2, 1);call write~init~int(0, 41, 3, 1);call #Ultimate.allocInit(5, 42);call write~init~int(49, 42, 0, 1);call write~init~int(56, 42, 1, 1);call write~init~int(49, 42, 2, 1);call write~init~int(52, 42, 3, 1);call write~init~int(0, 42, 4, 1);call #Ultimate.allocInit(4, 43);call write~init~int(73, 43, 0, 1);call write~init~int(66, 43, 1, 1);call write~init~int(77, 43, 2, 1);call write~init~int(0, 43, 3, 1);call #Ultimate.allocInit(5, 44);call write~init~int(49, 44, 0, 1);call write~init~int(56, 44, 1, 1);call write~init~int(49, 44, 2, 1);call write~init~int(53, 44, 3, 1);call write~init~int(0, 44, 4, 1);call #Ultimate.allocInit(4, 45);call write~init~int(73, 45, 0, 1);call write~init~int(66, 45, 1, 1);call write~init~int(77, 45, 2, 1);call write~init~int(0, 45, 3, 1);call #Ultimate.allocInit(5, 46);call write~init~int(49, 46, 0, 1);call write~init~int(56, 46, 1, 1);call write~init~int(49, 46, 2, 1);call write~init~int(56, 46, 3, 1);call write~init~int(0, 46, 4, 1);call #Ultimate.allocInit(4, 47);call write~init~int(73, 47, 0, 1);call write~init~int(66, 47, 1, 1);call write~init~int(77, 47, 2, 1);call write~init~int(0, 47, 3, 1);call #Ultimate.allocInit(5, 48);call write~init~int(51, 48, 0, 1);call write~init~int(53, 48, 1, 1);call write~init~int(50, 48, 2, 1);call write~init~int(54, 48, 3, 1);call write~init~int(0, 48, 4, 1);call #Ultimate.allocInit(4, 49);call write~init~int(83, 49, 0, 1);call write~init~int(71, 49, 1, 1);call write~init~int(73, 49, 2, 1);call write~init~int(0, 49, 3, 1);call #Ultimate.allocInit(4, 50);call write~init~int(84, 50, 0, 1);call write~init~int(80, 50, 1, 1);call write~init~int(57, 50, 2, 1);call write~init~int(0, 50, 3, 1);call #Ultimate.allocInit(4, 51);call write~init~int(83, 51, 0, 1);call write~init~int(71, 51, 1, 1);call write~init~int(73, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(3, 52);call write~init~int(73, 52, 0, 1);call write~init~int(83, 52, 1, 1);call write~init~int(0, 52, 2, 1);call #Ultimate.allocInit(4, 53);call write~init~int(83, 53, 0, 1);call write~init~int(84, 53, 1, 1);call write~init~int(75, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(17, 54);call #Ultimate.allocInit(4, 55);call write~init~int(83, 55, 0, 1);call write~init~int(84, 55, 1, 1);call write~init~int(75, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(4, 57);call write~init~int(83, 57, 0, 1);call write~init~int(85, 57, 1, 1);call write~init~int(78, 57, 2, 1);call write~init~int(0, 57, 3, 1);call #Ultimate.allocInit(4, 58);call write~init~int(67, 58, 0, 1);call write~init~int(83, 58, 1, 1);call write~init~int(77, 58, 2, 1);call write~init~int(0, 58, 3, 1);call #Ultimate.allocInit(4, 59);call write~init~int(83, 59, 0, 1);call write~init~int(85, 59, 1, 1);call write~init~int(78, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(8, 60);call #Ultimate.allocInit(4, 61);call write~init~int(83, 61, 0, 1);call write~init~int(85, 61, 1, 1);call write~init~int(78, 61, 2, 1);call write~init~int(0, 61, 3, 1);call #Ultimate.allocInit(13, 62);call #Ultimate.allocInit(4, 63);call write~init~int(83, 63, 0, 1);call write~init~int(85, 63, 1, 1);call write~init~int(78, 63, 2, 1);call write~init~int(0, 63, 3, 1);call #Ultimate.allocInit(9, 64);call #Ultimate.allocInit(4, 65);call write~init~int(83, 65, 0, 1);call write~init~int(85, 65, 1, 1);call write~init~int(78, 65, 2, 1);call write~init~int(0, 65, 3, 1);call #Ultimate.allocInit(13, 66);call #Ultimate.allocInit(5, 67);call write~init~int(68, 67, 0, 1);call write~init~int(69, 67, 1, 1);call write~init~int(76, 67, 2, 1);call write~init~int(76, 67, 3, 1);call write~init~int(0, 67, 4, 1);call #Ultimate.allocInit(4, 68);call write~init~int(77, 68, 0, 1);call write~init~int(68, 68, 1, 1);call write~init~int(51, 68, 2, 1);call write~init~int(0, 68, 3, 1);call #Ultimate.allocInit(7, 69);call write~init~int(78, 69, 0, 1);call write~init~int(69, 69, 1, 1);call write~init~int(84, 69, 2, 1);call write~init~int(65, 69, 3, 1);call write~init~int(80, 69, 4, 1);call write~init~int(80, 69, 5, 1);call write~init~int(0, 69, 6, 1);call #Ultimate.allocInit(10, 70);call #Ultimate.allocInit(4, 71);call write~init~int(76, 71, 0, 1);call write~init~int(83, 71, 1, 1);call write~init~int(73, 71, 2, 1);call write~init~int(0, 71, 3, 1);call #Ultimate.allocInit(10, 72);call #Ultimate.allocInit(8, 73);call #Ultimate.allocInit(10, 74);call #Ultimate.allocInit(2, 75);call write~init~int(13, 75, 0, 1);call write~init~int(0, 75, 1, 1);call #Ultimate.allocInit(22, 76);call #Ultimate.allocInit(5, 77);call write~init~int(114, 77, 0, 1);call write~init~int(100, 77, 1, 1);call write~init~int(97, 77, 2, 1);call write~init~int(99, 77, 3, 1);call write~init~int(0, 77, 4, 1);call #Ultimate.allocInit(5, 78);call write~init~int(114, 78, 0, 1);call write~init~int(100, 78, 1, 1);call write~init~int(97, 78, 2, 1);call write~init~int(99, 78, 3, 1);call write~init~int(0, 78, 4, 1);call #Ultimate.allocInit(41, 79);call #Ultimate.allocInit(19, 80);call #Ultimate.allocInit(3, 81);call write~init~int(37, 81, 0, 1);call write~init~int(115, 81, 1, 1);call write~init~int(0, 81, 2, 1);call #Ultimate.allocInit(13, 82);call #Ultimate.allocInit(32, 83);~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~#mode~0.base, ~#mode~0.offset := 84, 0;call #Ultimate.allocInit(24, 84);call write~init~$Pointer$(5, 0, ~#mode~0.base, ~#mode~0.offset, 8);call write~init~$Pointer$(6, 0, ~#mode~0.base, 8 + ~#mode~0.offset, 8);call write~init~$Pointer$(7, 0, ~#mode~0.base, 16 + ~#mode~0.offset, 8);~#lun_state~0.base, ~#lun_state~0.offset := 85, 0;call #Ultimate.allocInit(16, 85);call write~init~$Pointer$(8, 0, ~#lun_state~0.base, ~#lun_state~0.offset, 8);call write~init~$Pointer$(9, 0, ~#lun_state~0.base, 8 + ~#lun_state~0.offset, 8);~#ctlr_list~0.base, ~#ctlr_list~0.offset := 86, 0;call #Ultimate.allocInit(16, 86);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);call write~init~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, ~#ctlr_list~0.base, 8 + ~#ctlr_list~0.offset, 8);~#list_lock~0.base, ~#list_lock~0.offset := 87, 0;call #Ultimate.allocInit(68, 87);call write~init~int(0, ~#list_lock~0.base, ~#list_lock~0.offset, 4);call write~init~int(3735899821, ~#list_lock~0.base, 4 + ~#list_lock~0.offset, 4);call write~init~int(4294967295, ~#list_lock~0.base, 8 + ~#list_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#list_lock~0.base, 12 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 20 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 28 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#list_lock~0.base, 36 + ~#list_lock~0.offset, 8);call write~init~$Pointer$(10, 0, ~#list_lock~0.base, 44 + ~#list_lock~0.offset, 8);call write~init~int(0, ~#list_lock~0.base, 52 + ~#list_lock~0.offset, 4);call write~init~int(0, ~#list_lock~0.base, 56 + ~#list_lock~0.offset, 8);~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := 0, 0;~rdac_logging~0 := 1;~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset := 88, 0;call #Ultimate.allocInit(400, 88);call write~init~$Pointer$(27, 0, ~#rdac_dev_list~0.base, ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(28, 0, ~#rdac_dev_list~0.base, 8 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(29, 0, ~#rdac_dev_list~0.base, 16 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(30, 0, ~#rdac_dev_list~0.base, 24 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(31, 0, ~#rdac_dev_list~0.base, 32 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(32, 0, ~#rdac_dev_list~0.base, 40 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(33, 0, ~#rdac_dev_list~0.base, 48 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(34, 0, ~#rdac_dev_list~0.base, 56 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(35, 0, ~#rdac_dev_list~0.base, 64 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(36, 0, ~#rdac_dev_list~0.base, 72 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(37, 0, ~#rdac_dev_list~0.base, 80 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(38, 0, ~#rdac_dev_list~0.base, 88 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(39, 0, ~#rdac_dev_list~0.base, 96 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(40, 0, ~#rdac_dev_list~0.base, 104 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(41, 0, ~#rdac_dev_list~0.base, 112 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(42, 0, ~#rdac_dev_list~0.base, 120 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(43, 0, ~#rdac_dev_list~0.base, 128 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(44, 0, ~#rdac_dev_list~0.base, 136 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(45, 0, ~#rdac_dev_list~0.base, 144 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(46, 0, ~#rdac_dev_list~0.base, 152 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(47, 0, ~#rdac_dev_list~0.base, 160 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(48, 0, ~#rdac_dev_list~0.base, 168 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(49, 0, ~#rdac_dev_list~0.base, 176 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(50, 0, ~#rdac_dev_list~0.base, 184 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(51, 0, ~#rdac_dev_list~0.base, 192 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(52, 0, ~#rdac_dev_list~0.base, 200 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(53, 0, ~#rdac_dev_list~0.base, 208 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(54, 0, ~#rdac_dev_list~0.base, 216 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(55, 0, ~#rdac_dev_list~0.base, 224 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(56, 0, ~#rdac_dev_list~0.base, 232 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(57, 0, ~#rdac_dev_list~0.base, 240 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(58, 0, ~#rdac_dev_list~0.base, 248 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(59, 0, ~#rdac_dev_list~0.base, 256 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(60, 0, ~#rdac_dev_list~0.base, 264 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(61, 0, ~#rdac_dev_list~0.base, 272 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(62, 0, ~#rdac_dev_list~0.base, 280 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(63, 0, ~#rdac_dev_list~0.base, 288 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(64, 0, ~#rdac_dev_list~0.base, 296 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(65, 0, ~#rdac_dev_list~0.base, 304 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(66, 0, ~#rdac_dev_list~0.base, 312 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(67, 0, ~#rdac_dev_list~0.base, 320 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(68, 0, ~#rdac_dev_list~0.base, 328 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(69, 0, ~#rdac_dev_list~0.base, 336 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(70, 0, ~#rdac_dev_list~0.base, 344 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(71, 0, ~#rdac_dev_list~0.base, 352 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(72, 0, ~#rdac_dev_list~0.base, 360 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(73, 0, ~#rdac_dev_list~0.base, 368 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(74, 0, ~#rdac_dev_list~0.base, 376 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 384 + ~#rdac_dev_list~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dev_list~0.base, 392 + ~#rdac_dev_list~0.offset, 8);~#rdac_dh~0.base, ~#rdac_dh~0.offset := 89, 0;call #Ultimate.allocInit(88, 89);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 8 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#rdac_dh~0.base, 16 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(78, 0, ~#rdac_dh~0.base, 24 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_check_sense.base, #funAddr~rdac_check_sense.offset, ~#rdac_dh~0.base, 32 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_attach.base, #funAddr~rdac_bus_attach.offset, ~#rdac_dh~0.base, 40 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_bus_detach.base, #funAddr~rdac_bus_detach.offset, ~#rdac_dh~0.base, 48 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_activate.base, #funAddr~rdac_activate.offset, ~#rdac_dh~0.base, 56 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_prep_fn.base, #funAddr~rdac_prep_fn.offset, ~#rdac_dh~0.base, 64 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(0, 0, ~#rdac_dh~0.base, 72 + ~#rdac_dh~0.offset, 8);call write~init~$Pointer$(#funAddr~rdac_match.base, #funAddr~rdac_match.offset, ~#rdac_dh~0.base, 80 + ~#rdac_dh~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0.base, ~ldv_retval_1~0.offset := 0, 0;~ldv_spin~0 := 0; {28301#true} is VALID [2022-02-20 22:33:11,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {28301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset, main_#t~ret328#1.base, main_#t~ret328#1.offset, main_#t~ret329#1.base, main_#t~ret329#1.offset, main_#t~ret330#1.base, main_#t~ret330#1.offset, main_#t~nondet331#1, main_#t~switch332#1, main_#t~nondet333#1, main_#t~switch334#1, main_#t~ret335#1, main_#t~nondet336#1, main_#t~switch337#1, main_#t~mem338#1.base, main_#t~mem338#1.offset, main_#t~ret339#1, main_#t~ret340#1, main_#t~ret341#1.base, main_#t~ret341#1.offset, main_#t~ret342#1, main_#t~ret343#1, main_#t~ret344#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~25#1.base, main_~tmp~25#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~25#1.base, main_~tmp~25#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(8);havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~0#1; {28301#true} is VALID [2022-02-20 22:33:11,412 INFO L272 TraceCheckUtils]: 2: Hoare triple {28301#true} call main_#t~ret327#1.base, main_#t~ret327#1.offset := ldv_init_zalloc(368); {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L272 TraceCheckUtils]: 9: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,414 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28301#true} {28301#true} #1515#return; {28301#true} is VALID [2022-02-20 22:33:11,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {28301#true} main_~tmp~25#1.base, main_~tmp~25#1.offset := main_#t~ret327#1.base, main_#t~ret327#1.offset;havoc main_#t~ret327#1.base, main_#t~ret327#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~25#1.base, main_~tmp~25#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,416 INFO L272 TraceCheckUtils]: 18: Hoare triple {28301#true} call main_#t~ret328#1.base, main_#t~ret328#1.offset := ldv_init_zalloc(8); {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L272 TraceCheckUtils]: 20: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L272 TraceCheckUtils]: 25: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {28301#true} {28301#true} #1517#return; {28301#true} is VALID [2022-02-20 22:33:11,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {28301#true} main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset := main_#t~ret328#1.base, main_#t~ret328#1.offset;havoc main_#t~ret328#1.base, main_#t~ret328#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___0~11#1.base, main_~tmp___0~11#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,419 INFO L272 TraceCheckUtils]: 34: Hoare triple {28301#true} call main_#t~ret329#1.base, main_#t~ret329#1.offset := ldv_init_zalloc(1); {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,420 INFO L272 TraceCheckUtils]: 36: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,420 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,420 INFO L272 TraceCheckUtils]: 41: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {28301#true} {28301#true} #1519#return; {28301#true} is VALID [2022-02-20 22:33:11,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {28301#true} main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset := main_#t~ret329#1.base, main_#t~ret329#1.offset;havoc main_#t~ret329#1.base, main_#t~ret329#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~6#1.base, main_~tmp___1~6#1.offset;assume { :begin_inline_ldv_initialize } true; {28301#true} is VALID [2022-02-20 22:33:11,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {28301#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_memset } true;ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset, ldv_memset_#in~c#1, ldv_memset_#in~n#1 := main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 8;havoc ldv_memset_#res#1.base, ldv_memset_#res#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset, ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1, ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset;ldv_memset_~s#1.base, ldv_memset_~s#1.offset := ldv_memset_#in~s#1.base, ldv_memset_#in~s#1.offset;ldv_memset_~c#1 := ldv_memset_#in~c#1;ldv_memset_~n#1 := ldv_memset_#in~n#1;havoc ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L272 TraceCheckUtils]: 51: Hoare triple {28301#true} call ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset := #Ultimate.C_memset(ldv_memset_~s#1.base, ldv_memset_~s#1.offset, ldv_memset_~c#1, ldv_memset_~n#1); {28462#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:33:11,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {28462#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr371 := 0; {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {28301#true} assume !(#t~loopctr371 % 18446744073709551616 < #amount % 18446744073709551616); {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {28301#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28301#true} {28301#true} #1521#return; {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {28301#true} ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset := ldv_memset_~s#1.base, ldv_memset_~s#1.offset;havoc ldv_memset_#t~memset~res15#1.base, ldv_memset_#t~memset~res15#1.offset;ldv_memset_#res#1.base, ldv_memset_#res#1.offset := ldv_memset_~tmp~3#1.base, ldv_memset_~tmp~3#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {28301#true} main_#t~ret330#1.base, main_#t~ret330#1.offset := ldv_memset_#res#1.base, ldv_memset_#res#1.offset;assume { :end_inline_ldv_memset } true;havoc main_#t~ret330#1.base, main_#t~ret330#1.offset;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {28301#true} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {28301#true} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {28301#true} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {28301#true} assume main_#t~switch332#1; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {28301#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet333#1 && main_#t~nondet333#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet333#1;havoc main_#t~nondet333#1;main_#t~switch334#1 := 0 == main_~tmp___3~2#1; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {28301#true} assume !main_#t~switch334#1;main_#t~switch334#1 := main_#t~switch334#1 || 1 == main_~tmp___3~2#1; {28301#true} is VALID [2022-02-20 22:33:11,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {28301#true} assume main_#t~switch334#1; {28301#true} is VALID [2022-02-20 22:33:11,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {28301#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_rdac_init } true;havoc rdac_init_#res#1;havoc rdac_init_#t~ret318#1, rdac_init_#t~nondet319#1, rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset, rdac_init_#t~ret321#1, rdac_init_#t~nondet322#1, rdac_init_~r~0#1, rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset, rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset, rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;havoc rdac_init_~r~0#1;call rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset := #Ultimate.allocOnStack(8);havoc rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset;havoc rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset;assume { :begin_inline_ldv_scsi_register_device_handler_30 } true;ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset := ~#rdac_dh~0.base, ~#rdac_dh~0.offset;havoc ldv_scsi_register_device_handler_30_#res#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1, ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset, ldv_scsi_register_device_handler_30_~ldv_func_res~4#1, ldv_scsi_register_device_handler_30_~tmp~33#1;ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset := ldv_scsi_register_device_handler_30_#in~scsi_dh#1.base, ldv_scsi_register_device_handler_30_#in~scsi_dh#1.offset;havoc ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;havoc ldv_scsi_register_device_handler_30_~tmp~33#1;assume { :begin_inline_scsi_register_device_handler } true;scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset := ldv_scsi_register_device_handler_30_~scsi_dh#1.base, ldv_scsi_register_device_handler_30_~scsi_dh#1.offset;havoc scsi_register_device_handler_#res#1;havoc scsi_register_device_handler_#t~nondet367#1, scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset;scsi_register_device_handler_~arg0#1.base, scsi_register_device_handler_~arg0#1.offset := scsi_register_device_handler_#in~arg0#1.base, scsi_register_device_handler_#in~arg0#1.offset;assume -2147483648 <= scsi_register_device_handler_#t~nondet367#1 && scsi_register_device_handler_#t~nondet367#1 <= 2147483647;scsi_register_device_handler_#res#1 := scsi_register_device_handler_#t~nondet367#1;havoc scsi_register_device_handler_#t~nondet367#1; {28301#true} is VALID [2022-02-20 22:33:11,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {28301#true} ldv_scsi_register_device_handler_30_#t~ret352#1 := scsi_register_device_handler_#res#1;assume { :end_inline_scsi_register_device_handler } true;assume -2147483648 <= ldv_scsi_register_device_handler_30_#t~ret352#1 && ldv_scsi_register_device_handler_30_#t~ret352#1 <= 2147483647;ldv_scsi_register_device_handler_30_~tmp~33#1 := ldv_scsi_register_device_handler_30_#t~ret352#1;havoc ldv_scsi_register_device_handler_30_#t~ret352#1;ldv_scsi_register_device_handler_30_~ldv_func_res~4#1 := ldv_scsi_register_device_handler_30_~tmp~33#1; {28301#true} is VALID [2022-02-20 22:33:11,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {28301#true} assume 0 == ldv_scsi_register_device_handler_30_~ldv_func_res~4#1;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_scsi_device_handler_2 } true;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset, ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset;havoc ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,425 INFO L272 TraceCheckUtils]: 68: Hoare triple {28301#true} call ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset := ldv_init_zalloc(3480); {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {28439#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~2.base, ~tmp~2.offset;call #t~malloc14.base, #t~malloc14.offset := #Ultimate.allocOnHeap(~size); {28301#true} is VALID [2022-02-20 22:33:11,426 INFO L272 TraceCheckUtils]: 70: Hoare triple {28301#true} call #Ultimate.meminit(#t~malloc14.base, #t~malloc14.offset, 1, ~size, ~size); {28447#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:33:11,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {28447#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28301#true} {28301#true} #1511#return; {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {28301#true} ~tmp~2.base, ~tmp~2.offset := #t~malloc14.base, #t~malloc14.offset;~p~2.base, ~p~2.offset := ~tmp~2.base, ~tmp~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L272 TraceCheckUtils]: 75: Hoare triple {28301#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {28301#true} ~cond := #in~cond; {28301#true} is VALID [2022-02-20 22:33:11,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {28301#true} assume !(0 == ~cond); {28301#true} is VALID [2022-02-20 22:33:11,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,428 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28301#true} {28301#true} #1513#return; {28301#true} is VALID [2022-02-20 22:33:11,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {28301#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {28301#true} is VALID [2022-02-20 22:33:11,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,432 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28301#true} {28301#true} #1537#return; {28301#true} is VALID [2022-02-20 22:33:11,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {28301#true} ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset := ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;havoc ldv_scsi_device_handler_2_#t~ret326#1.base, ldv_scsi_device_handler_2_#t~ret326#1.offset;~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset := ldv_scsi_device_handler_2_~tmp~24#1.base, ldv_scsi_device_handler_2_~tmp~24#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {28301#true} assume { :end_inline_ldv_scsi_device_handler_2 } true; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {28301#true} ldv_scsi_register_device_handler_30_#res#1 := ldv_scsi_register_device_handler_30_~ldv_func_res~4#1; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {28301#true} rdac_init_#t~ret318#1 := ldv_scsi_register_device_handler_30_#res#1;assume { :end_inline_ldv_scsi_register_device_handler_30 } true;assume -2147483648 <= rdac_init_#t~ret318#1 && rdac_init_#t~ret318#1 <= 2147483647;rdac_init_~r~0#1 := rdac_init_#t~ret318#1;havoc rdac_init_#t~ret318#1; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {28301#true} assume !(0 != rdac_init_~r~0#1);rdac_init_~__lock_name~0#1.base, rdac_init_~__lock_name~0#1.offset := 80, 0;havoc rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset := rdac_init_#t~nondet320#1.base, rdac_init_#t~nondet320#1.offset;~kmpath_rdacd~0.base, ~kmpath_rdacd~0.offset := rdac_init_~tmp~22#1.base, rdac_init_~tmp~22#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {28301#true} assume !(0 == (~kmpath_rdacd~0.base + ~kmpath_rdacd~0.offset) % 18446744073709551616); {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 89: Hoare triple {28301#true} rdac_init_#res#1 := rdac_init_~r~0#1;call ULTIMATE.dealloc(rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset);havoc rdac_init_~#__key~1#1.base, rdac_init_~#__key~1#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 90: Hoare triple {28301#true} main_#t~ret335#1 := rdac_init_#res#1;assume { :end_inline_rdac_init } true;assume -2147483648 <= main_#t~ret335#1 && main_#t~ret335#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret335#1;havoc main_#t~ret335#1; {28301#true} is VALID [2022-02-20 22:33:11,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {28301#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {28301#true} assume !(0 != ~ldv_retval_0~0); {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {28301#true} assume -2147483648 <= main_#t~nondet331#1 && main_#t~nondet331#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet331#1;havoc main_#t~nondet331#1;main_#t~switch332#1 := 0 == main_~tmp___2~3#1; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 94: Hoare triple {28301#true} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 1 == main_~tmp___2~3#1; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {28301#true} assume !main_#t~switch332#1;main_#t~switch332#1 := main_#t~switch332#1 || 2 == main_~tmp___2~3#1; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 96: Hoare triple {28301#true} assume main_#t~switch332#1; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 97: Hoare triple {28301#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet336#1 && main_#t~nondet336#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet336#1;havoc main_#t~nondet336#1;main_#t~switch337#1 := 0 == main_~tmp___4~0#1; {28301#true} is VALID [2022-02-20 22:33:11,434 INFO L290 TraceCheckUtils]: 98: Hoare triple {28301#true} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 1 == main_~tmp___4~0#1; {28301#true} is VALID [2022-02-20 22:33:11,435 INFO L290 TraceCheckUtils]: 99: Hoare triple {28301#true} assume !main_#t~switch337#1;main_#t~switch337#1 := main_#t~switch337#1 || 2 == main_~tmp___4~0#1; {28301#true} is VALID [2022-02-20 22:33:11,435 INFO L290 TraceCheckUtils]: 100: Hoare triple {28301#true} assume main_#t~switch337#1; {28301#true} is VALID [2022-02-20 22:33:11,435 INFO L290 TraceCheckUtils]: 101: Hoare triple {28301#true} assume 1 == ~ldv_state_variable_2~0;assume { :begin_inline_rdac_bus_attach } true;rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset := ~rdac_dh_group1~0.base, ~rdac_dh_group1~0.offset;havoc rdac_bus_attach_#res#1.base, rdac_bus_attach_#res#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset, rdac_bus_attach_#t~ret297#1.base, rdac_bus_attach_#t~ret297#1.offset, rdac_bus_attach_#t~ret298#1, rdac_bus_attach_#t~ret299#1, rdac_bus_attach_#t~ret300#1, rdac_bus_attach_#t~ret301#1, rdac_bus_attach_#t~mem302#1, rdac_bus_attach_#t~mem303#1, rdac_bus_attach_#t~mem304#1.base, rdac_bus_attach_#t~mem304#1.offset, rdac_bus_attach_#t~mem305#1, rdac_bus_attach_#t~mem306#1.base, rdac_bus_attach_#t~mem306#1.offset, rdac_bus_attach_#t~mem307#1.base, rdac_bus_attach_#t~mem307#1.offset, rdac_bus_attach_#t~ret308#1, rdac_bus_attach_#t~ret309#1.base, rdac_bus_attach_#t~ret309#1.offset, rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~err~8#1, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset, rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset, rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset, rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset;rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset := rdac_bus_attach_#in~sdev#1.base, rdac_bus_attach_#in~sdev#1.offset;havoc rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset;havoc rdac_bus_attach_~err~8#1;call rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset := #Ultimate.allocOnStack(31);call rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset := #Ultimate.allocOnStack(16);havoc rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset;havoc rdac_bus_attach_~tmp___0~10#1.base, rdac_bus_attach_~tmp___0~10#1.offset;havoc rdac_bus_attach_~tmp___1~5#1.base, rdac_bus_attach_~tmp___1~5#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,436 INFO L272 TraceCheckUtils]: 102: Hoare triple {28301#true} call rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset := kmalloc(392, 208); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,436 INFO L290 TraceCheckUtils]: 103: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {28301#true} is VALID [2022-02-20 22:33:11,436 INFO L290 TraceCheckUtils]: 104: Hoare triple {28301#true} assume !(0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296); {28301#true} is VALID [2022-02-20 22:33:11,436 INFO L290 TraceCheckUtils]: 105: Hoare triple {28301#true} assume { :end_inline_ldv_check_alloc_flags } true; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L272 TraceCheckUtils]: 106: Hoare triple {28301#true} call #t~ret351#1.base, #t~ret351#1.offset := ldv_malloc(~size#1); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,437 INFO L290 TraceCheckUtils]: 107: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L290 TraceCheckUtils]: 108: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L290 TraceCheckUtils]: 109: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {28301#true} {28301#true} #1473#return; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L290 TraceCheckUtils]: 111: Hoare triple {28301#true} ~tmp~32#1.base, ~tmp~32#1.offset := #t~ret351#1.base, #t~ret351#1.offset;havoc #t~ret351#1.base, #t~ret351#1.offset;#res#1.base, #res#1.offset := ~tmp~32#1.base, ~tmp~32#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,437 INFO L290 TraceCheckUtils]: 112: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,438 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {28301#true} {28301#true} #1565#return; {28301#true} is VALID [2022-02-20 22:33:11,438 INFO L290 TraceCheckUtils]: 114: Hoare triple {28301#true} rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset := rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset;havoc rdac_bus_attach_#t~ret296#1.base, rdac_bus_attach_#t~ret296#1.offset;rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset := rdac_bus_attach_~tmp~20#1.base, rdac_bus_attach_~tmp~20#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,438 INFO L290 TraceCheckUtils]: 115: Hoare triple {28301#true} assume !(0 == (rdac_bus_attach_~h~5#1.base + rdac_bus_attach_~h~5#1.offset) % 18446744073709551616);call write~int(256, rdac_bus_attach_~h~5#1.base, 28 + rdac_bus_attach_~h~5#1.offset, 4);call write~int(0, rdac_bus_attach_~h~5#1.base, 33 + rdac_bus_attach_~h~5#1.offset, 1);assume { :begin_inline_get_lun_info } true;get_lun_info_#in~sdev#1.base, get_lun_info_#in~sdev#1.offset, get_lun_info_#in~h#1.base, get_lun_info_#in~h#1.offset, get_lun_info_#in~array_name#1.base, get_lun_info_#in~array_name#1.offset, get_lun_info_#in~array_id#1.base, get_lun_info_#in~array_id#1.offset := rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset;havoc get_lun_info_#res#1;havoc get_lun_info_#t~ret163#1, get_lun_info_#t~mem164#1, get_lun_info_#t~mem165#1, get_lun_info_#t~mem166#1, get_lun_info_#t~short167#1, get_lun_info_#t~mem168#1, get_lun_info_#t~short169#1, get_lun_info_#t~mem170#1, get_lun_info_#t~short171#1, get_lun_info_#t~mem172#1, get_lun_info_#t~mem173#1, get_lun_info_#t~memset~res174#1.base, get_lun_info_#t~memset~res174#1.offset, get_lun_info_#t~mem175#1, get_lun_info_#t~memcpy~res176#1.base, get_lun_info_#t~memcpy~res176#1.offset, get_lun_info_~sdev#1.base, get_lun_info_~sdev#1.offset, get_lun_info_~h#1.base, get_lun_info_~h#1.offset, get_lun_info_~array_name#1.base, get_lun_info_~array_name#1.offset, get_lun_info_~array_id#1.base, get_lun_info_~array_id#1.offset, get_lun_info_~err~1#1, get_lun_info_~i~0#1, get_lun_info_~inqp~0#1.base, get_lun_info_~inqp~0#1.offset;get_lun_info_~sdev#1.base, get_lun_info_~sdev#1.offset := get_lun_info_#in~sdev#1.base, get_lun_info_#in~sdev#1.offset;get_lun_info_~h#1.base, get_lun_info_~h#1.offset := get_lun_info_#in~h#1.base, get_lun_info_#in~h#1.offset;get_lun_info_~array_name#1.base, get_lun_info_~array_name#1.offset := get_lun_info_#in~array_name#1.base, get_lun_info_#in~array_name#1.offset;get_lun_info_~array_id#1.base, get_lun_info_~array_id#1.offset := get_lun_info_#in~array_id#1.base, get_lun_info_#in~array_id#1.offset;havoc get_lun_info_~err~1#1;havoc get_lun_info_~i~0#1;havoc get_lun_info_~inqp~0#1.base, get_lun_info_~inqp~0#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,439 INFO L272 TraceCheckUtils]: 116: Hoare triple {28301#true} call get_lun_info_#t~ret163#1 := submit_inquiry(get_lun_info_~sdev#1.base, get_lun_info_~sdev#1.offset, 200, 175, get_lun_info_~h#1.base, get_lun_info_~h#1.offset); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,439 INFO L290 TraceCheckUtils]: 117: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev.base, ~sdev.offset := #in~sdev.base, #in~sdev.offset;~page_code := #in~page_code;~len := #in~len;~h.base, ~h.offset := #in~h.base, #in~h.offset;havoc ~rq~2.base, ~rq~2.offset;havoc ~q~1.base, ~q~1.offset;havoc ~err~0;call #t~mem153.base, #t~mem153.offset := read~$Pointer$(~sdev.base, 8 + ~sdev.offset, 8);~q~1.base, ~q~1.offset := #t~mem153.base, #t~mem153.offset;havoc #t~mem153.base, #t~mem153.offset;~err~0 := 13; {28301#true} is VALID [2022-02-20 22:33:11,441 INFO L272 TraceCheckUtils]: 118: Hoare triple {28301#true} call #t~ret154.base, #t~ret154.offset := get_rdac_req(~sdev.base, ~sdev.offset, ~h.base, 132 + ~h.offset, ~len, 0); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,441 INFO L290 TraceCheckUtils]: 119: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,441 INFO L272 TraceCheckUtils]: 120: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,441 INFO L290 TraceCheckUtils]: 121: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,441 INFO L290 TraceCheckUtils]: 122: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L290 TraceCheckUtils]: 123: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L290 TraceCheckUtils]: 125: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L290 TraceCheckUtils]: 126: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L272 TraceCheckUtils]: 127: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L290 TraceCheckUtils]: 128: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,442 INFO L272 TraceCheckUtils]: 129: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L290 TraceCheckUtils]: 130: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L290 TraceCheckUtils]: 131: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L290 TraceCheckUtils]: 133: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L290 TraceCheckUtils]: 134: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,443 INFO L290 TraceCheckUtils]: 136: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 137: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 138: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 140: Hoare triple {28301#true} ~rq~2.base, ~rq~2.offset := #t~ret154.base, #t~ret154.offset;havoc #t~ret154.base, #t~ret154.offset; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 141: Hoare triple {28301#true} assume 0 == (~rq~2.base + ~rq~2.offset) % 18446744073709551616; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 142: Hoare triple {28301#true} #res := ~err~0; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L290 TraceCheckUtils]: 143: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,444 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {28301#true} {28301#true} #1569#return; {28301#true} is VALID [2022-02-20 22:33:11,445 INFO L290 TraceCheckUtils]: 145: Hoare triple {28301#true} assume -2147483648 <= get_lun_info_#t~ret163#1 && get_lun_info_#t~ret163#1 <= 2147483647;get_lun_info_~err~1#1 := get_lun_info_#t~ret163#1;havoc get_lun_info_#t~ret163#1; {28301#true} is VALID [2022-02-20 22:33:11,445 INFO L290 TraceCheckUtils]: 146: Hoare triple {28301#true} assume !(0 == get_lun_info_~err~1#1); {28402#(not (= |ULTIMATE.start_get_lun_info_~err~1#1| 0))} is VALID [2022-02-20 22:33:11,446 INFO L290 TraceCheckUtils]: 147: Hoare triple {28402#(not (= |ULTIMATE.start_get_lun_info_~err~1#1| 0))} get_lun_info_#res#1 := get_lun_info_~err~1#1; {28403#(not (= |ULTIMATE.start_get_lun_info_#res#1| 0))} is VALID [2022-02-20 22:33:11,446 INFO L290 TraceCheckUtils]: 148: Hoare triple {28403#(not (= |ULTIMATE.start_get_lun_info_#res#1| 0))} rdac_bus_attach_#t~ret298#1 := get_lun_info_#res#1;assume { :end_inline_get_lun_info } true;assume -2147483648 <= rdac_bus_attach_#t~ret298#1 && rdac_bus_attach_#t~ret298#1 <= 2147483647;rdac_bus_attach_~err~8#1 := rdac_bus_attach_#t~ret298#1;havoc rdac_bus_attach_#t~ret298#1; {28404#(not (= |ULTIMATE.start_rdac_bus_attach_~err~8#1| 0))} is VALID [2022-02-20 22:33:11,446 INFO L290 TraceCheckUtils]: 149: Hoare triple {28404#(not (= |ULTIMATE.start_rdac_bus_attach_~err~8#1| 0))} assume !(0 != rdac_bus_attach_~err~8#1);assume { :begin_inline_initialize_controller } true;initialize_controller_#in~sdev#1.base, initialize_controller_#in~sdev#1.offset, initialize_controller_#in~h#1.base, initialize_controller_#in~h#1.offset, initialize_controller_#in~array_name#1.base, initialize_controller_#in~array_name#1.offset, initialize_controller_#in~array_id#1.base, initialize_controller_#in~array_id#1.offset := rdac_bus_attach_~sdev#1.base, rdac_bus_attach_~sdev#1.offset, rdac_bus_attach_~h~5#1.base, rdac_bus_attach_~h~5#1.offset, rdac_bus_attach_~#array_name~0#1.base, rdac_bus_attach_~#array_name~0#1.offset, rdac_bus_attach_~#array_id~0#1.base, rdac_bus_attach_~#array_id~0#1.offset;havoc initialize_controller_#res#1;havoc initialize_controller_#t~ret183#1, initialize_controller_#t~mem184#1, initialize_controller_#t~ret185#1.base, initialize_controller_#t~ret185#1.offset, initialize_controller_#t~mem186#1.base, initialize_controller_#t~mem186#1.offset, initialize_controller_~sdev#1.base, initialize_controller_~sdev#1.offset, initialize_controller_~h#1.base, initialize_controller_~h#1.offset, initialize_controller_~array_name#1.base, initialize_controller_~array_name#1.offset, initialize_controller_~array_id#1.base, initialize_controller_~array_id#1.offset, initialize_controller_~err~3#1, initialize_controller_~index~0#1, initialize_controller_~inqp~2#1.base, initialize_controller_~inqp~2#1.offset;initialize_controller_~sdev#1.base, initialize_controller_~sdev#1.offset := initialize_controller_#in~sdev#1.base, initialize_controller_#in~sdev#1.offset;initialize_controller_~h#1.base, initialize_controller_~h#1.offset := initialize_controller_#in~h#1.base, initialize_controller_#in~h#1.offset;initialize_controller_~array_name#1.base, initialize_controller_~array_name#1.offset := initialize_controller_#in~array_name#1.base, initialize_controller_#in~array_name#1.offset;initialize_controller_~array_id#1.base, initialize_controller_~array_id#1.offset := initialize_controller_#in~array_id#1.base, initialize_controller_#in~array_id#1.offset;havoc initialize_controller_~err~3#1;havoc initialize_controller_~index~0#1;havoc initialize_controller_~inqp~2#1.base, initialize_controller_~inqp~2#1.offset; {28302#false} is VALID [2022-02-20 22:33:11,447 INFO L272 TraceCheckUtils]: 150: Hoare triple {28302#false} call initialize_controller_#t~ret183#1 := submit_inquiry(initialize_controller_~sdev#1.base, initialize_controller_~sdev#1.offset, 196, 32, initialize_controller_~h#1.base, initialize_controller_~h#1.offset); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,447 INFO L290 TraceCheckUtils]: 151: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev.base, ~sdev.offset := #in~sdev.base, #in~sdev.offset;~page_code := #in~page_code;~len := #in~len;~h.base, ~h.offset := #in~h.base, #in~h.offset;havoc ~rq~2.base, ~rq~2.offset;havoc ~q~1.base, ~q~1.offset;havoc ~err~0;call #t~mem153.base, #t~mem153.offset := read~$Pointer$(~sdev.base, 8 + ~sdev.offset, 8);~q~1.base, ~q~1.offset := #t~mem153.base, #t~mem153.offset;havoc #t~mem153.base, #t~mem153.offset;~err~0 := 13; {28301#true} is VALID [2022-02-20 22:33:11,448 INFO L272 TraceCheckUtils]: 152: Hoare triple {28301#true} call #t~ret154.base, #t~ret154.offset := get_rdac_req(~sdev.base, ~sdev.offset, ~h.base, 132 + ~h.offset, ~len, 0); {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,448 INFO L290 TraceCheckUtils]: 153: Hoare triple {28475#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~sdev#1.base, ~sdev#1.offset := #in~sdev#1.base, #in~sdev#1.offset;~buffer#1.base, ~buffer#1.offset := #in~buffer#1.base, #in~buffer#1.offset;~buflen#1 := #in~buflen#1;~rw#1 := #in~rw#1;havoc ~rq~0#1.base, ~rq~0#1.offset;havoc ~q~0#1.base, ~q~0#1.offset;havoc ~tmp~11#1;havoc ~tmp___0~4#1;call #t~mem110#1.base, #t~mem110#1.offset := read~$Pointer$(~sdev#1.base, 8 + ~sdev#1.offset, 8);~q~0#1.base, ~q~0#1.offset := #t~mem110#1.base, #t~mem110#1.offset;havoc #t~mem110#1.base, #t~mem110#1.offset;assume { :begin_inline_blk_get_request } true;blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset, blk_get_request_#in~arg1#1, blk_get_request_#in~arg2#1 := ~q~0#1.base, ~q~0#1.offset, ~rw#1, 16;havoc blk_get_request_#res#1.base, blk_get_request_#res#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset, blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset, blk_get_request_~arg1#1, blk_get_request_~arg2#1;blk_get_request_~arg0#1.base, blk_get_request_~arg0#1.offset := blk_get_request_#in~arg0#1.base, blk_get_request_#in~arg0#1.offset;blk_get_request_~arg1#1 := blk_get_request_#in~arg1#1;blk_get_request_~arg2#1 := blk_get_request_#in~arg2#1; {28301#true} is VALID [2022-02-20 22:33:11,449 INFO L272 TraceCheckUtils]: 154: Hoare triple {28301#true} call blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset := ldv_malloc(352); {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:33:11,449 INFO L290 TraceCheckUtils]: 155: Hoare triple {28470#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~tmp___0~0 := #t~nondet8;havoc #t~nondet8; {28301#true} is VALID [2022-02-20 22:33:11,449 INFO L290 TraceCheckUtils]: 156: Hoare triple {28301#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,449 INFO L290 TraceCheckUtils]: 157: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,449 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {28301#true} {28301#true} #1465#return; {28301#true} is VALID [2022-02-20 22:33:11,449 INFO L290 TraceCheckUtils]: 159: Hoare triple {28301#true} blk_get_request_#res#1.base, blk_get_request_#res#1.offset := blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset;havoc blk_get_request_#t~ret360#1.base, blk_get_request_#t~ret360#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L290 TraceCheckUtils]: 160: Hoare triple {28301#true} #t~ret111#1.base, #t~ret111#1.offset := blk_get_request_#res#1.base, blk_get_request_#res#1.offset;assume { :end_inline_blk_get_request } true;~rq~0#1.base, ~rq~0#1.offset := #t~ret111#1.base, #t~ret111#1.offset;havoc #t~ret111#1.base, #t~ret111#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L272 TraceCheckUtils]: 161: Hoare triple {28301#true} call #t~ret112#1 := IS_ERR(~rq~0#1.base, ~rq~0#1.offset); {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L290 TraceCheckUtils]: 162: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L272 TraceCheckUtils]: 163: Hoare triple {28301#true} call #t~ret346 := ldv_is_err(~ptr.base, ~ptr.offset); {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L290 TraceCheckUtils]: 164: Hoare triple {28301#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if 0 == (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0) then 0 else 1); {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L290 TraceCheckUtils]: 165: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {28301#true} {28301#true} #1631#return; {28301#true} is VALID [2022-02-20 22:33:11,450 INFO L290 TraceCheckUtils]: 167: Hoare triple {28301#true} ~tmp~27 := #t~ret346;havoc #t~ret346;#res := ~tmp~27; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L290 TraceCheckUtils]: 168: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {28301#true} {28301#true} #1467#return; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L290 TraceCheckUtils]: 170: Hoare triple {28301#true} ~tmp~11#1 := #t~ret112#1;havoc #t~ret112#1; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L290 TraceCheckUtils]: 171: Hoare triple {28301#true} assume 0 != ~tmp~11#1 % 256;#res#1.base, #res#1.offset := 0, 0; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L290 TraceCheckUtils]: 172: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {28301#true} {28301#true} #1403#return; {28301#true} is VALID [2022-02-20 22:33:11,451 INFO L290 TraceCheckUtils]: 174: Hoare triple {28301#true} ~rq~2.base, ~rq~2.offset := #t~ret154.base, #t~ret154.offset;havoc #t~ret154.base, #t~ret154.offset; {28301#true} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 175: Hoare triple {28301#true} assume 0 == (~rq~2.base + ~rq~2.offset) % 18446744073709551616; {28301#true} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 176: Hoare triple {28301#true} #res := ~err~0; {28301#true} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 177: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,452 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {28301#true} {28302#false} #1575#return; {28302#false} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 179: Hoare triple {28302#false} assume -2147483648 <= initialize_controller_#t~ret183#1 && initialize_controller_#t~ret183#1 <= 2147483647;initialize_controller_~err~3#1 := initialize_controller_#t~ret183#1;havoc initialize_controller_#t~ret183#1; {28302#false} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 180: Hoare triple {28302#false} assume 0 == initialize_controller_~err~3#1;initialize_controller_~inqp~2#1.base, initialize_controller_~inqp~2#1.offset := initialize_controller_~h#1.base, 132 + initialize_controller_~h#1.offset;call initialize_controller_#t~mem184#1 := read~int(initialize_controller_~inqp~2#1.base, 29 + initialize_controller_~inqp~2#1.offset, 1); {28302#false} is VALID [2022-02-20 22:33:11,452 INFO L290 TraceCheckUtils]: 181: Hoare triple {28302#false} assume 49 == initialize_controller_#t~mem184#1 % 256 % 4294967296;havoc initialize_controller_#t~mem184#1;initialize_controller_~index~0#1 := 0; {28302#false} is VALID [2022-02-20 22:33:11,453 INFO L272 TraceCheckUtils]: 182: Hoare triple {28302#false} call spin_lock(~#list_lock~0.base, ~#list_lock~0.offset); {28548#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:33:11,453 INFO L290 TraceCheckUtils]: 183: Hoare triple {28548#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~lock#1.base, ~lock#1.offset := #in~lock#1.base, #in~lock#1.offset;assume { :begin_inline_ldv_spin_lock } true;~ldv_spin~0 := 1; {28301#true} is VALID [2022-02-20 22:33:11,453 INFO L290 TraceCheckUtils]: 184: Hoare triple {28301#true} assume { :end_inline_ldv_spin_lock } true;assume { :begin_inline_ldv_spin_lock_5 } true;ldv_spin_lock_5_#in~lock#1.base, ldv_spin_lock_5_#in~lock#1.offset := ~lock#1.base, ~lock#1.offset;havoc ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset;ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset := ldv_spin_lock_5_#in~lock#1.base, ldv_spin_lock_5_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_5_~lock#1.base, ldv_spin_lock_5_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {28301#true} is VALID [2022-02-20 22:33:11,453 INFO L290 TraceCheckUtils]: 185: Hoare triple {28301#true} assume { :end_inline__raw_spin_lock } true; {28301#true} is VALID [2022-02-20 22:33:11,453 INFO L290 TraceCheckUtils]: 186: Hoare triple {28301#true} assume { :end_inline_ldv_spin_lock_5 } true; {28301#true} is VALID [2022-02-20 22:33:11,453 INFO L290 TraceCheckUtils]: 187: Hoare triple {28301#true} assume true; {28301#true} is VALID [2022-02-20 22:33:11,453 INFO L284 TraceCheckUtils]: 188: Hoare quadruple {28301#true} {28302#false} #1577#return; {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L290 TraceCheckUtils]: 189: Hoare triple {28302#false} assume { :begin_inline_get_controller } true;get_controller_#in~index#1, get_controller_#in~array_name#1.base, get_controller_#in~array_name#1.offset, get_controller_#in~array_id#1.base, get_controller_#in~array_id#1.offset, get_controller_#in~sdev#1.base, get_controller_#in~sdev#1.offset := initialize_controller_~index~0#1, initialize_controller_~array_name#1.base, initialize_controller_~array_name#1.offset, initialize_controller_~array_id#1.base, initialize_controller_~array_id#1.offset, initialize_controller_~sdev#1.base, initialize_controller_~sdev#1.offset;havoc get_controller_#res#1.base, get_controller_#res#1.offset;havoc get_controller_#t~mem139#1.base, get_controller_#t~mem139#1.offset, get_controller_#t~ret140#1, get_controller_#t~mem141#1, get_controller_#t~short142#1, get_controller_#t~mem143#1.base, get_controller_#t~mem143#1.offset, get_controller_#t~mem144#1.base, get_controller_#t~mem144#1.offset, get_controller_#t~short145#1, get_controller_#t~mem146#1.base, get_controller_#t~mem146#1.offset, get_controller_#t~ret147#1.base, get_controller_#t~ret147#1.offset, get_controller_#t~memcpy~res148#1.base, get_controller_#t~memcpy~res148#1.offset, get_controller_#t~mem149#1.base, get_controller_#t~mem149#1.offset, get_controller_#t~memcpy~res150#1.base, get_controller_#t~memcpy~res150#1.offset, get_controller_#t~ret151#1.base, get_controller_#t~ret151#1.offset, get_controller_#t~mem152#1, get_controller_~index#1, get_controller_~array_name#1.base, get_controller_~array_name#1.offset, get_controller_~array_id#1.base, get_controller_~array_id#1.offset, get_controller_~sdev#1.base, get_controller_~sdev#1.offset, get_controller_~ctlr~1#1.base, get_controller_~ctlr~1#1.offset, get_controller_~tmp~12#1.base, get_controller_~tmp~12#1.offset, get_controller_~__mptr~3#1.base, get_controller_~__mptr~3#1.offset, get_controller_~tmp___0~5#1, get_controller_~__mptr___0~1#1.base, get_controller_~__mptr___0~1#1.offset, get_controller_~tmp___1~1#1.base, get_controller_~tmp___1~1#1.offset, get_controller_~#__key~0#1.base, get_controller_~#__key~0#1.offset, get_controller_~#__key___0~0#1.base, get_controller_~#__key___0~0#1.offset, get_controller_~#__constr_expr_0~0#1.base, get_controller_~#__constr_expr_0~0#1.offset;get_controller_~index#1 := get_controller_#in~index#1;get_controller_~array_name#1.base, get_controller_~array_name#1.offset := get_controller_#in~array_name#1.base, get_controller_#in~array_name#1.offset;get_controller_~array_id#1.base, get_controller_~array_id#1.offset := get_controller_#in~array_id#1.base, get_controller_#in~array_id#1.offset;get_controller_~sdev#1.base, get_controller_~sdev#1.offset := get_controller_#in~sdev#1.base, get_controller_#in~sdev#1.offset;havoc get_controller_~ctlr~1#1.base, get_controller_~ctlr~1#1.offset;havoc get_controller_~tmp~12#1.base, get_controller_~tmp~12#1.offset;havoc get_controller_~__mptr~3#1.base, get_controller_~__mptr~3#1.offset;havoc get_controller_~tmp___0~5#1;havoc get_controller_~__mptr___0~1#1.base, get_controller_~__mptr___0~1#1.offset;havoc get_controller_~tmp___1~1#1.base, get_controller_~tmp___1~1#1.offset;call get_controller_~#__key~0#1.base, get_controller_~#__key~0#1.offset := #Ultimate.allocOnStack(8);call get_controller_~#__key___0~0#1.base, get_controller_~#__key___0~0#1.offset := #Ultimate.allocOnStack(8);call get_controller_~#__constr_expr_0~0#1.base, get_controller_~#__constr_expr_0~0#1.offset := #Ultimate.allocOnStack(8);call get_controller_#t~mem139#1.base, get_controller_#t~mem139#1.offset := read~$Pointer$(~#ctlr_list~0.base, ~#ctlr_list~0.offset, 8);get_controller_~__mptr~3#1.base, get_controller_~__mptr~3#1.offset := get_controller_#t~mem139#1.base, get_controller_#t~mem139#1.offset;havoc get_controller_#t~mem139#1.base, get_controller_#t~mem139#1.offset;get_controller_~tmp~12#1.base, get_controller_~tmp~12#1.offset := get_controller_~__mptr~3#1.base, -13440 + get_controller_~__mptr~3#1.offset; {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L290 TraceCheckUtils]: 190: Hoare triple {28302#false} assume !((get_controller_~tmp~12#1.base + (24 + get_controller_~tmp~12#1.offset)) % 18446744073709551616 != (~#ctlr_list~0.base + ~#ctlr_list~0.offset) % 18446744073709551616); {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L272 TraceCheckUtils]: 191: Hoare triple {28302#false} call get_controller_#t~ret147#1.base, get_controller_#t~ret147#1.offset := kmalloc(576, 32); {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L290 TraceCheckUtils]: 192: Hoare triple {28302#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~32#1.base, ~tmp~32#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L290 TraceCheckUtils]: 193: Hoare triple {28302#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L272 TraceCheckUtils]: 194: Hoare triple {28302#false} call ldv_error(); {28302#false} is VALID [2022-02-20 22:33:11,454 INFO L290 TraceCheckUtils]: 195: Hoare triple {28302#false} assume !false; {28302#false} is VALID [2022-02-20 22:33:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-02-20 22:33:11,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:33:11,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446758119] [2022-02-20 22:33:11,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446758119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:33:11,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:33:11,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 22:33:11,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863702279] [2022-02-20 22:33:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:33:11,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 196 [2022-02-20 22:33:11,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:33:11,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 22:33:11,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:33:11,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 22:33:11,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:33:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 22:33:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:33:11,581 INFO L87 Difference]: Start difference. First operand 877 states and 1209 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (18), 8 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)