./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-32_7a-drivers--memstick--core--ms_block.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-32_7a-drivers--memstick--core--ms_block.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 1264b42ba0b5dcb83ee2e2b35dfcd5adbd8a3fb1fa3fff4328b672883ffa55c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:17:50,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:17:50,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:17:51,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:17:51,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:17:51,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:17:51,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:17:51,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:17:51,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:17:51,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:17:51,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:17:51,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:17:51,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:17:51,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:17:51,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:17:51,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:17:51,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:17:51,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:17:51,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:17:51,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:17:51,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:17:51,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:17:51,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:17:51,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:17:51,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:17:51,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:17:51,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:17:51,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:17:51,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:17:51,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:17:51,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:17:51,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:17:51,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:17:51,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:17:51,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:17:51,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:17:51,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:17:51,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:17:51,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:17:51,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:17:51,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:17:51,093 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:17:51,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:17:51,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:17:51,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:17:51,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:17:51,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:17:51,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:17:51,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:17:51,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:17:51,123 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:17:51,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:17:51,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:17:51,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:17:51,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:17:51,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:17:51,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:17:51,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:17:51,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:17:51,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:17:51,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:17:51,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:17:51,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:17:51,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:17:51,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:17:51,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:17:51,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:17:51,128 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 -> 1264b42ba0b5dcb83ee2e2b35dfcd5adbd8a3fb1fa3fff4328b672883ffa55c1 [2022-02-20 22:17:51,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:17:51,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:17:51,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:17:51,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:17:51,360 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:17:51,360 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-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:17:51,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825152a55/f61292d228ee4f7ebf6bf186d211123b/FLAGd07208e21 [2022-02-20 22:17:51,991 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:17:51,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:17:52,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825152a55/f61292d228ee4f7ebf6bf186d211123b/FLAGd07208e21 [2022-02-20 22:17:52,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825152a55/f61292d228ee4f7ebf6bf186d211123b [2022-02-20 22:17:52,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:17:52,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:17:52,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:17:52,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:17:52,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:17:52,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:17:52" (1/1) ... [2022-02-20 22:17:52,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581534da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:52, skipping insertion in model container [2022-02-20 22:17:52,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:17:52" (1/1) ... [2022-02-20 22:17:52,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:17:52,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:17:53,544 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-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[237227,237240] [2022-02-20 22:17:53,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:17:53,666 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:17:53,985 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-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[237227,237240] [2022-02-20 22:17:53,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:17:54,061 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:17:54,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54 WrapperNode [2022-02-20 22:17:54,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:17:54,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:17:54,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:17:54,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:17:54,069 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:17:54" (1/1) ... [2022-02-20 22:17:54,146 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:17:54" (1/1) ... [2022-02-20 22:17:54,293 INFO L137 Inliner]: procedures = 306, calls = 1743, calls flagged for inlining = 109, calls inlined = 100, statements flattened = 3808 [2022-02-20 22:17:54,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:17:54,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:17:54,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:17:54,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:17:54,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:17:54,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:17:54,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:17:54,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:17:54,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (1/1) ... [2022-02-20 22:17:54,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:17:54,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:17:54,479 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:17:54,493 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:17:54,514 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-02-20 22:17:54,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-02-20 22:17:54,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_memstick_host [2022-02-20 22:17:54,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_memstick_host [2022-02-20 22:17:54,515 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-02-20 22:17:54,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-02-20 22:17:54,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:17:54,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:17:54,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:17:54,516 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:17:54,516 INFO L130 BoogieDeclarations]: Found specification of procedure msb_stop [2022-02-20 22:17:54,519 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_stop [2022-02-20 22:17:54,519 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_pba [2022-02-20 22:17:54,519 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_pba [2022-02-20 22:17:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-02-20 22:17:54,520 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-02-20 22:17:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:17:54,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:17:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure blk_fetch_request [2022-02-20 22:17:54,520 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_fetch_request [2022-02-20 22:17:54,520 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-02-20 22:17:54,520 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-02-20 22:17:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2022-02-20 22:17:54,521 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2022-02-20 22:17:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:17:54,521 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:17:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:17:54,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:17:54,521 INFO L130 BoogieDeclarations]: Found specification of procedure msb_switch_to_parallel [2022-02-20 22:17:54,521 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_switch_to_parallel [2022-02-20 22:17:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:17:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:17:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:17:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:17:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure msb_validate_used_block_bitmap [2022-02-20 22:17:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_validate_used_block_bitmap [2022-02-20 22:17:54,522 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-02-20 22:17:54,522 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-02-20 22:17:54,523 INFO L130 BoogieDeclarations]: Found specification of procedure msb_verify_block [2022-02-20 22:17:54,523 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_verify_block [2022-02-20 22:17:54,523 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:17:54,523 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:17:54,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_2 [2022-02-20 22:17:54,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_2 [2022-02-20 22:17:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_msb_disk_lock [2022-02-20 22:17:54,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_msb_disk_lock [2022-02-20 22:17:54,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:17:54,525 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_write [2022-02-20 22:17:54,525 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_write [2022-02-20 22:17:54,525 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 22:17:54,525 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2022-02-20 22:17:54,525 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2022-02-20 22:17:54,525 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_set_drvdata [2022-02-20 22:17:54,525 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_set_drvdata [2022-02-20 22:17:54,526 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request [2022-02-20 22:17:54,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request [2022-02-20 22:17:54,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:17:54,526 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-02-20 22:17:54,527 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-02-20 22:17:54,527 INFO L130 BoogieDeclarations]: Found specification of procedure msb_invalidate_reg_window [2022-02-20 22:17:54,528 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_invalidate_reg_window [2022-02-20 22:17:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure msb_io_work [2022-02-20 22:17:54,528 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_io_work [2022-02-20 22:17:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:17:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:17:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_table [2022-02-20 22:17:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_table [2022-02-20 22:17:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:17:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure msb_erase_block [2022-02-20 22:17:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_erase_block [2022-02-20 22:17:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:17:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_get_drvdata [2022-02-20 22:17:54,530 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_get_drvdata [2022-02-20 22:17:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure msb_data_clear [2022-02-20 22:17:54,530 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_data_clear [2022-02-20 22:17:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 22:17:54,530 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 22:17:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-02-20 22:17:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-02-20 22:17:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:17:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:17:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-02-20 22:17:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-02-20 22:17:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 22:17:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 22:17:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_bad_block_table [2022-02-20 22:17:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_bad_block_table [2022-02-20 22:17:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure msb_update_block [2022-02-20 22:17:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_update_block [2022-02-20 22:17:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_flush [2022-02-20 22:17:54,533 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_flush [2022-02-20 22:17:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_next [2022-02-20 22:17:54,533 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_next [2022-02-20 22:17:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-02-20 22:17:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-02-20 22:17:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_start [2022-02-20 22:17:54,534 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_start [2022-02-20 22:17:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure msb_run_state_machine [2022-02-20 22:17:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_run_state_machine [2022-02-20 22:17:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure msb_sg_copy [2022-02-20 22:17:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_sg_copy [2022-02-20 22:17:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2022-02-20 22:17:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2022-02-20 22:17:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:17:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:17:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure find_next_zero_bit [2022-02-20 22:17:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure find_next_zero_bit [2022-02-20 22:17:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock_of_memstick_host [2022-02-20 22:17:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock_of_memstick_host [2022-02-20 22:17:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:17:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 22:17:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 22:17:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_lba [2022-02-20 22:17:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_lba [2022-02-20 22:17:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure msb_reset [2022-02-20 22:17:54,537 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_reset [2022-02-20 22:17:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_2 [2022-02-20 22:17:54,538 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_2 [2022-02-20 22:17:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2022-02-20 22:17:54,539 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2022-02-20 22:17:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:17:54,541 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:17:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-02-20 22:17:54,542 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-02-20 22:17:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure msb_bd_getgeo [2022-02-20 22:17:54,544 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_bd_getgeo [2022-02-20 22:17:54,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:17:54,544 INFO L130 BoogieDeclarations]: Found specification of procedure msb_remove [2022-02-20 22:17:54,544 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_remove [2022-02-20 22:17:54,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:17:54,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:17:54,548 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2022-02-20 22:17:54,548 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2022-02-20 22:17:54,548 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_bad [2022-02-20 22:17:54,548 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_bad [2022-02-20 22:17:54,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:17:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:17:54,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:17:54,549 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_2 [2022-02-20 22:17:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_2 [2022-02-20 22:17:54,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:17:54,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:17:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:17:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure sg_nents [2022-02-20 22:17:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_nents [2022-02-20 22:17:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:17:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_page [2022-02-20 22:17:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_page [2022-02-20 22:17:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-02-20 22:17:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-02-20 22:17:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_stop [2022-02-20 22:17:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_stop [2022-02-20 22:17:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure msb_set_overwrite_flag [2022-02-20 22:17:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_set_overwrite_flag [2022-02-20 22:17:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_bytes [2022-02-20 22:17:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_bytes [2022-02-20 22:17:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-02-20 22:17:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-02-20 22:17:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure msb_disk_release [2022-02-20 22:17:54,552 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_disk_release [2022-02-20 22:17:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_block_used [2022-02-20 22:17:54,552 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_block_used [2022-02-20 22:17:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_discard [2022-02-20 22:17:54,552 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_discard [2022-02-20 22:17:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:17:54,552 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:17:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure msb_start [2022-02-20 22:17:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_start [2022-02-20 22:17:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:17:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:17:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-02-20 22:17:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-02-20 22:17:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-02-20 22:17:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-02-20 22:17:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure msb_init_card [2022-02-20 22:17:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_init_card [2022-02-20 22:17:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_page [2022-02-20 22:17:54,554 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_page [2022-02-20 22:17:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 22:17:54,554 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 22:17:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:17:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_one [2022-02-20 22:17:54,554 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_one [2022-02-20 22:17:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-02-20 22:17:54,554 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-02-20 22:17:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_msb_disk_lock [2022-02-20 22:17:54,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_msb_disk_lock [2022-02-20 22:17:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:17:54,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:17:55,047 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:17:55,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:17:55,216 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:17:59,678 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:17:59,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:17:59,693 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:17:59,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:17:59 BoogieIcfgContainer [2022-02-20 22:17:59,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:17:59,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:17:59,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:17:59,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:17:59,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:17:52" (1/3) ... [2022-02-20 22:17:59,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c25b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:17:59, skipping insertion in model container [2022-02-20 22:17:59,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:17:54" (2/3) ... [2022-02-20 22:17:59,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c25b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:17:59, skipping insertion in model container [2022-02-20 22:17:59,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:17:59" (3/3) ... [2022-02-20 22:17:59,702 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:17:59,706 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:17:59,706 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:17:59,741 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:17:59,745 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:17:59,746 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:17:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 1468 states, 1036 states have (on average 1.3793436293436294) internal successors, (1429), 1080 states have internal predecessors, (1429), 343 states have call successors, (343), 88 states have call predecessors, (343), 87 states have return successors, (337), 331 states have call predecessors, (337), 337 states have call successors, (337) [2022-02-20 22:17:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 22:17:59,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:17:59,795 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 22:17:59,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:17:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:17:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1635477223, now seen corresponding path program 1 times [2022-02-20 22:17:59,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:17:59,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135070715] [2022-02-20 22:17:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:17:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:18:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:18:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {1471#true} is VALID [2022-02-20 22:18:00,163 INFO L272 TraceCheckUtils]: 1: Hoare triple {1471#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {1536#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:00,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,163 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {1471#true} is VALID [2022-02-20 22:18:00,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1471#true} is VALID [2022-02-20 22:18:00,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1472#false} is VALID [2022-02-20 22:18:00,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,176 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1472#false} {1471#true} #3787#return; {1472#false} is VALID [2022-02-20 22:18:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:18:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {1471#true} is VALID [2022-02-20 22:18:00,205 INFO L272 TraceCheckUtils]: 1: Hoare triple {1471#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {1536#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:00,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,206 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {1471#true} is VALID [2022-02-20 22:18:00,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1471#true} is VALID [2022-02-20 22:18:00,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1472#false} is VALID [2022-02-20 22:18:00,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,208 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1472#false} {1472#false} #3789#return; {1472#false} is VALID [2022-02-20 22:18:00,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:18:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,234 INFO L272 TraceCheckUtils]: 1: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,235 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,235 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1471#true} {1472#false} #3791#return; {1472#false} is VALID [2022-02-20 22:18:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 22:18:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,254 INFO L272 TraceCheckUtils]: 1: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,255 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,256 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1471#true} {1472#false} #3793#return; {1472#false} is VALID [2022-02-20 22:18:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 22:18:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:00,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,275 INFO L272 TraceCheckUtils]: 1: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,275 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,276 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1471#true} {1472#false} #3795#return; {1472#false} is VALID [2022-02-20 22:18:00,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#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(86, 2);call #Ultimate.allocInit(57, 3);call #Ultimate.allocInit(60, 4);call #Ultimate.allocInit(64, 5);call #Ultimate.allocInit(211, 6);call #Ultimate.allocInit(211, 7);call #Ultimate.allocInit(211, 8);call #Ultimate.allocInit(211, 9);call #Ultimate.allocInit(37, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(59, 13);call #Ultimate.allocInit(40, 14);call #Ultimate.allocInit(35, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(37, 17);call #Ultimate.allocInit(37, 18);call #Ultimate.allocInit(67, 19);call #Ultimate.allocInit(33, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(27, 22);call #Ultimate.allocInit(47, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(49, 25);call #Ultimate.allocInit(69, 26);call #Ultimate.allocInit(48, 27);call #Ultimate.allocInit(58, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(65, 30);call #Ultimate.allocInit(48, 31);call #Ultimate.allocInit(63, 32);call #Ultimate.allocInit(65, 33);call #Ultimate.allocInit(41, 34);call #Ultimate.allocInit(56, 35);call #Ultimate.allocInit(52, 36);call #Ultimate.allocInit(103, 37);call #Ultimate.allocInit(70, 38);call #Ultimate.allocInit(51, 39);call #Ultimate.allocInit(38, 40);call #Ultimate.allocInit(38, 41);call #Ultimate.allocInit(55, 42);call #Ultimate.allocInit(49, 43);call #Ultimate.allocInit(62, 44);call #Ultimate.allocInit(48, 45);call #Ultimate.allocInit(69, 46);call #Ultimate.allocInit(48, 47);call #Ultimate.allocInit(41, 48);call #Ultimate.allocInit(58, 49);call #Ultimate.allocInit(55, 50);call #Ultimate.allocInit(55, 51);call #Ultimate.allocInit(40, 52);call #Ultimate.allocInit(72, 53);call #Ultimate.allocInit(57, 54);call #Ultimate.allocInit(54, 55);call #Ultimate.allocInit(48, 56);call #Ultimate.allocInit(46, 57);call #Ultimate.allocInit(82, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(37, 60);call #Ultimate.allocInit(38, 61);call #Ultimate.allocInit(55, 62);call #Ultimate.allocInit(64, 63);call #Ultimate.allocInit(30, 64);call #Ultimate.allocInit(55, 65);call #Ultimate.allocInit(50, 66);call #Ultimate.allocInit(31, 67);call #Ultimate.allocInit(51, 68);call #Ultimate.allocInit(35, 69);call #Ultimate.allocInit(47, 70);call #Ultimate.allocInit(46, 71);call #Ultimate.allocInit(46, 72);call #Ultimate.allocInit(95, 73);call #Ultimate.allocInit(34, 74);call #Ultimate.allocInit(39, 75);call #Ultimate.allocInit(56, 76);call #Ultimate.allocInit(60, 77);call #Ultimate.allocInit(62, 78);call #Ultimate.allocInit(37, 79);call #Ultimate.allocInit(55, 80);call #Ultimate.allocInit(34, 81);call #Ultimate.allocInit(46, 82);call #Ultimate.allocInit(57, 83);call #Ultimate.allocInit(58, 84);call #Ultimate.allocInit(48, 85);call #Ultimate.allocInit(35, 86);call #Ultimate.allocInit(44, 87);call #Ultimate.allocInit(33, 88);call #Ultimate.allocInit(40, 89);call #Ultimate.allocInit(26, 90);call #Ultimate.allocInit(87, 91);call #Ultimate.allocInit(32, 92);call #Ultimate.allocInit(33, 93);call #Ultimate.allocInit(29, 94);call #Ultimate.allocInit(41, 95);call #Ultimate.allocInit(39, 96);call #Ultimate.allocInit(60, 97);call #Ultimate.allocInit(38, 98);call #Ultimate.allocInit(18, 99);call #Ultimate.allocInit(24, 100);call #Ultimate.allocInit(14, 101);call #Ultimate.allocInit(30, 102);call #Ultimate.allocInit(33, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(27, 105);call #Ultimate.allocInit(46, 106);call #Ultimate.allocInit(211, 107);call #Ultimate.allocInit(36, 108);call #Ultimate.allocInit(37, 109);call #Ultimate.allocInit(8, 110);call #Ultimate.allocInit(47, 111);call #Ultimate.allocInit(11, 112);call #Ultimate.allocInit(9, 113);call #Ultimate.allocInit(16, 114);call #Ultimate.allocInit(23, 115);call #Ultimate.allocInit(23, 116);call #Ultimate.allocInit(37, 117);call #Ultimate.allocInit(27, 118);call #Ultimate.allocInit(53, 119);call #Ultimate.allocInit(9, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(48, 122);call #Ultimate.allocInit(9, 123);call #Ultimate.allocInit(58, 124);call #Ultimate.allocInit(9, 125);~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_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_timer_2_0~0 := 0;~msb_driver_group0~0.base, ~msb_driver_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_work_1_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_work_1_2~0 := 0;~ldv_timer_2_3~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~msb_bdops_group0~0.base, ~msb_bdops_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~debug~0 := 0;~cache_flush_timeout~0 := 1000;~verify_writes~0 := 0;~#chs_table~0.base, ~#chs_table~0.offset := 126, 0;call #Ultimate.allocInit(84, 126);call write~init~int(4, ~#chs_table~0.base, ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 8 + ~#chs_table~0.offset, 1);call write~init~int(247, ~#chs_table~0.base, 9 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 11 + ~#chs_table~0.offset, 1);call write~init~int(8, ~#chs_table~0.base, 12 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 20 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 21 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 23 + ~#chs_table~0.offset, 1);call write~init~int(16, ~#chs_table~0.base, 24 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 32 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 33 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 35 + ~#chs_table~0.offset, 1);call write~init~int(32, ~#chs_table~0.base, 36 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 44 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 45 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 47 + ~#chs_table~0.offset, 1);call write~init~int(64, ~#chs_table~0.base, 48 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 56 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 57 + ~#chs_table~0.offset, 2);call write~init~int(8, ~#chs_table~0.base, 59 + ~#chs_table~0.offset, 1);call write~init~int(128, ~#chs_table~0.base, 60 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 68 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 69 + ~#chs_table~0.offset, 2);call write~init~int(16, ~#chs_table~0.base, 71 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 72 + ~#chs_table~0.offset, 8);call write~init~int(0, ~#chs_table~0.base, 80 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 81 + ~#chs_table~0.offset, 2);call write~init~int(0, ~#chs_table~0.base, 83 + ~#chs_table~0.offset, 1);~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset := 127, 0;call #Ultimate.allocInit(104, 127);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 8 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 16 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 20 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 24 + ~#msb_disk_idr~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_idr~0.base, 28 + ~#msb_disk_idr~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_idr~0.base, 32 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_idr~0.base, 36 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 44 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 52 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 60 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(99, 0, ~#msb_disk_idr~0.base, 68 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 76 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 80 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 92 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 96 + ~#msb_disk_idr~0.offset, 8);~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset := 128, 0;call #Ultimate.allocInit(148, 128);call write~init~int(1, ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 4 + ~#msb_disk_lock~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_lock~0.base, 8 + ~#msb_disk_lock~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_lock~0.base, 12 + ~#msb_disk_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_lock~0.base, 16 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 24 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 32 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 40 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(100, 0, ~#msb_disk_lock~0.base, 48 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 56 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 60 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 80 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 88 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 96 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 104 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 112 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 120 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(101, 0, ~#msb_disk_lock~0.base, 128 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 136 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 140 + ~#msb_disk_lock~0.offset, 8);~#msb_bdops~0.base, ~#msb_bdops~0.offset := 129, 0;call #Ultimate.allocInit(104, 129);call write~init~$Pointer$(#funAddr~msb_bd_open.base, #funAddr~msb_bd_open.offset, ~#msb_bdops~0.base, ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_release.base, #funAddr~msb_bd_release.offset, ~#msb_bdops~0.base, 8 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 16 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 24 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 32 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 40 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 48 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 56 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 64 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 72 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_getgeo.base, #funAddr~msb_bd_getgeo.offset, ~#msb_bdops~0.base, 80 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 88 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_bdops~0.base, 96 + ~#msb_bdops~0.offset, 8);~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset := 130, 0;call #Ultimate.allocInit(24, 130);call write~init~int(1, ~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 1 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 2 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 3 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 4 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 5 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 6 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 7 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 8 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 9 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 10 + ~#msb_id_tbl~0.offset, 1);call write~init~int(2, ~#msb_id_tbl~0.base, 11 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 12 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 13 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 14 + ~#msb_id_tbl~0.offset, 1);call write~init~int(3, ~#msb_id_tbl~0.base, 15 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 16 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 17 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 18 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 19 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 20 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 21 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 22 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 23 + ~#msb_id_tbl~0.offset, 1);~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[5 := 0];~#msb_driver~0.base, ~#msb_driver~0.offset := 131, 0;call #Ultimate.allocInit(157, 131);call write~init~$Pointer$(~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, ~#msb_driver~0.base, ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_probe.base, #funAddr~msb_probe.offset, ~#msb_driver~0.base, 8 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_remove.base, #funAddr~msb_remove.offset, ~#msb_driver~0.base, 16 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_suspend.base, #funAddr~msb_suspend.offset, ~#msb_driver~0.base, 24 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_resume.base, #funAddr~msb_resume.offset, ~#msb_driver~0.base, 32 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(120, 0, ~#msb_driver~0.base, 40 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 48 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_driver~0.base, 56 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 64 + ~#msb_driver~0.offset, 8);call write~init~int(0, ~#msb_driver~0.base, 72 + ~#msb_driver~0.offset, 1);call write~init~int(0, ~#msb_driver~0.base, 73 + ~#msb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 77 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 85 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 93 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 101 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 109 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 117 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 125 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 133 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 141 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 149 + ~#msb_driver~0.offset, 8);~major~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_lock_of_memstick_host~0 := 1;~ldv_mutex_msb_disk_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {1471#true} is VALID [2022-02-20 22:18:00,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset, main_#t~ret1017#1.base, main_#t~ret1017#1.offset, main_#t~ret1018#1.base, main_#t~ret1018#1.offset, main_#t~ret1019#1.base, main_#t~ret1019#1.offset, main_#t~ret1020#1.base, main_#t~ret1020#1.offset, main_#t~nondet1021#1, main_#t~switch1022#1, main_#t~nondet1023#1, main_#t~switch1024#1, main_#t~mem1025#1, main_#t~ret1026#1, main_#t~ret1027#1, main_#t~mem1028#1, main_#t~ret1029#1, main_#t~nondet1030#1, main_#t~switch1031#1, main_#t~ret1032#1, main_#t~nondet1033#1, main_#t~switch1034#1, main_#t~ret1035#1, main_#t~mem1036#1, main_#t~ret1037#1, main_#t~ret1038#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~63#1.base, main_~tmp~63#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~tmp___1~22#1, main_~tmp___2~14#1, main_~tmp___3~10#1, main_~tmp___4~7#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~63#1.base, main_~tmp~63#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~22#1;havoc main_~tmp___2~14#1;havoc main_~tmp___3~10#1;havoc main_~tmp___4~7#1; {1471#true} is VALID [2022-02-20 22:18:00,279 INFO L272 TraceCheckUtils]: 2: Hoare triple {1471#true} call main_#t~ret1016#1.base, main_#t~ret1016#1.offset := ldv_init_zalloc(16); {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:00,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {1471#true} is VALID [2022-02-20 22:18:00,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {1536#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:00,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,281 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {1471#true} is VALID [2022-02-20 22:18:00,281 INFO L272 TraceCheckUtils]: 9: Hoare triple {1471#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1471#true} is VALID [2022-02-20 22:18:00,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,282 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1472#false} is VALID [2022-02-20 22:18:00,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1472#false} {1471#true} #3787#return; {1472#false} is VALID [2022-02-20 22:18:00,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#false} main_~tmp~63#1.base, main_~tmp~63#1.offset := main_#t~ret1016#1.base, main_#t~ret1016#1.offset;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~63#1.base, main_~tmp~63#1.offset; {1472#false} is VALID [2022-02-20 22:18:00,283 INFO L272 TraceCheckUtils]: 18: Hoare triple {1472#false} call main_#t~ret1017#1.base, main_#t~ret1017#1.offset := ldv_init_zalloc(1744); {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:00,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {1471#true} is VALID [2022-02-20 22:18:00,284 INFO L272 TraceCheckUtils]: 20: Hoare triple {1471#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {1536#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:00,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {1536#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1471#true} is VALID [2022-02-20 22:18:00,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,285 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1471#true} {1471#true} #3375#return; {1471#true} is VALID [2022-02-20 22:18:00,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {1471#true} is VALID [2022-02-20 22:18:00,285 INFO L272 TraceCheckUtils]: 25: Hoare triple {1471#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1471#true} is VALID [2022-02-20 22:18:00,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 22:18:00,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#true} assume 0 == ~cond;assume false; {1472#false} is VALID [2022-02-20 22:18:00,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,286 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1472#false} {1471#true} #3377#return; {1472#false} is VALID [2022-02-20 22:18:00,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {1472#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1472#false} is VALID [2022-02-20 22:18:00,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 22:18:00,286 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1472#false} {1472#false} #3789#return; {1472#false} is VALID [2022-02-20 22:18:00,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {1472#false} main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset := main_#t~ret1017#1.base, main_#t~ret1017#1.offset;havoc main_#t~ret1017#1.base, main_#t~ret1017#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;assume { :begin_inline_ldv_initialize } true; {1472#false} is VALID [2022-02-20 22:18:00,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {1472#false} assume { :end_inline_ldv_initialize } true; {1472#false} is VALID [2022-02-20 22:18:00,287 INFO L272 TraceCheckUtils]: 35: Hoare triple {1472#false} call main_#t~ret1018#1.base, main_#t~ret1018#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {1544#(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:18:00,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,288 INFO L272 TraceCheckUtils]: 37: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,289 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,290 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1471#true} {1472#false} #3791#return; {1472#false} is VALID [2022-02-20 22:18:00,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {1472#false} havoc main_#t~ret1018#1.base, main_#t~ret1018#1.offset; {1472#false} is VALID [2022-02-20 22:18:00,290 INFO L272 TraceCheckUtils]: 46: Hoare triple {1472#false} call main_#t~ret1019#1.base, main_#t~ret1019#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {1544#(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:18:00,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,291 INFO L272 TraceCheckUtils]: 48: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,292 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,292 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1471#true} {1472#false} #3793#return; {1472#false} is VALID [2022-02-20 22:18:00,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {1472#false} havoc main_#t~ret1019#1.base, main_#t~ret1019#1.offset; {1472#false} is VALID [2022-02-20 22:18:00,293 INFO L272 TraceCheckUtils]: 57: Hoare triple {1472#false} call main_#t~ret1020#1.base, main_#t~ret1020#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 4); {1544#(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:18:00,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,294 INFO L272 TraceCheckUtils]: 59: Hoare triple {1471#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1544#(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:18:00,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {1544#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {1471#true} is VALID [2022-02-20 22:18:00,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {1471#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {1471#true} is VALID [2022-02-20 22:18:00,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {1471#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1471#true} is VALID [2022-02-20 22:18:00,295 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {1471#true} {1471#true} #3391#return; {1471#true} is VALID [2022-02-20 22:18:00,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {1471#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {1471#true} is VALID [2022-02-20 22:18:00,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 22:18:00,295 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {1471#true} {1472#false} #3795#return; {1472#false} is VALID [2022-02-20 22:18:00,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {1472#false} havoc main_#t~ret1020#1.base, main_#t~ret1020#1.offset;~ldv_state_variable_4~0 := 0;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; {1472#false} is VALID [2022-02-20 22:18:00,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {1472#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_3~0 := 0;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {1472#false} is VALID [2022-02-20 22:18:00,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {1472#false} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1; {1472#false} is VALID [2022-02-20 22:18:00,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {1472#false} assume -2147483648 <= main_#t~nondet1021#1 && main_#t~nondet1021#1 <= 2147483647;main_~tmp___1~22#1 := main_#t~nondet1021#1;havoc main_#t~nondet1021#1;main_#t~switch1022#1 := 0 == main_~tmp___1~22#1; {1472#false} is VALID [2022-02-20 22:18:00,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {1472#false} assume main_#t~switch1022#1; {1472#false} is VALID [2022-02-20 22:18:00,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {1472#false} assume 0 != ~ldv_state_variable_4~0;assume -2147483648 <= main_#t~nondet1023#1 && main_#t~nondet1023#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet1023#1;havoc main_#t~nondet1023#1;main_#t~switch1024#1 := 0 == main_~tmp___2~14#1; {1472#false} is VALID [2022-02-20 22:18:00,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {1472#false} assume main_#t~switch1024#1; {1472#false} is VALID [2022-02-20 22:18:00,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {1472#false} assume 2 == ~ldv_state_variable_4~0;call main_#t~mem1025#1 := read~int(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 4);assume { :begin_inline_msb_bd_release } true;msb_bd_release_#in~disk#1.base, msb_bd_release_#in~disk#1.offset, msb_bd_release_#in~mode#1 := main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_#t~mem1025#1;havoc msb_bd_release_#t~ret869#1, msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset, msb_bd_release_~mode#1;msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset := msb_bd_release_#in~disk#1.base, msb_bd_release_#in~disk#1.offset;msb_bd_release_~mode#1 := msb_bd_release_#in~mode#1; {1472#false} is VALID [2022-02-20 22:18:00,297 INFO L272 TraceCheckUtils]: 75: Hoare triple {1472#false} call msb_bd_release_#t~ret869#1 := msb_disk_release(msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset); {1472#false} is VALID [2022-02-20 22:18:00,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {1472#false} ~disk#1.base, ~disk#1.offset := #in~disk#1.base, #in~disk#1.offset;havoc ~msb~9#1.base, ~msb~9#1.offset;call #t~mem863#1.base, #t~mem863#1.offset := read~$Pointer$(~disk#1.base, 1569 + ~disk#1.offset, 8);~msb~9#1.base, ~msb~9#1.offset := #t~mem863#1.base, #t~mem863#1.offset;havoc #t~mem863#1.base, #t~mem863#1.offset; {1472#false} is VALID [2022-02-20 22:18:00,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {1472#false} assume !(~debug~0 > 1); {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {1472#false} assume { :begin_inline_ldv_mutex_lock_21 } true;ldv_mutex_lock_21_#in~ldv_func_arg1#1.base, ldv_mutex_lock_21_#in~ldv_func_arg1#1.offset := ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset;havoc ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset;ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset := ldv_mutex_lock_21_#in~ldv_func_arg1#1.base, ldv_mutex_lock_21_#in~ldv_func_arg1#1.offset; {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L272 TraceCheckUtils]: 79: Hoare triple {1472#false} call ldv_mutex_lock_msb_disk_lock(ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset); {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L290 TraceCheckUtils]: 80: Hoare triple {1472#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {1472#false} assume 1 != ~ldv_mutex_msb_disk_lock~0; {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L272 TraceCheckUtils]: 82: Hoare triple {1472#false} call ldv_error(); {1472#false} is VALID [2022-02-20 22:18:00,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-02-20 22:18:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 22:18:00,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:18:00,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135070715] [2022-02-20 22:18:00,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135070715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:18:00,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:18:00,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:18:00,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205615174] [2022-02-20 22:18:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:18:00,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2022-02-20 22:18:00,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:18:00,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:00,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:18:00,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:18:00,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:18:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:18:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:18:00,392 INFO L87 Difference]: Start difference. First operand has 1468 states, 1036 states have (on average 1.3793436293436294) internal successors, (1429), 1080 states have internal predecessors, (1429), 343 states have call successors, (343), 88 states have call predecessors, (343), 87 states have return successors, (337), 331 states have call predecessors, (337), 337 states have call successors, (337) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:13,395 INFO L93 Difference]: Finished difference Result 3245 states and 4865 transitions. [2022-02-20 22:18:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:18:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2022-02-20 22:18:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:18:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4865 transitions. [2022-02-20 22:18:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4865 transitions. [2022-02-20 22:18:13,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4865 transitions. [2022-02-20 22:18:17,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4865 edges. 4865 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:18:17,964 INFO L225 Difference]: With dead ends: 3245 [2022-02-20 22:18:17,964 INFO L226 Difference]: Without dead ends: 1755 [2022-02-20 22:18:17,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:18:17,982 INFO L933 BasicCegarLoop]: 1974 mSDtfsCounter, 1554 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 22:18:17,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1599 Valid, 3080 Invalid, 2428 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1498 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-02-20 22:18:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2022-02-20 22:18:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1443. [2022-02-20 22:18:18,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:18:18,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1755 states. Second operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) [2022-02-20 22:18:18,088 INFO L74 IsIncluded]: Start isIncluded. First operand 1755 states. Second operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) [2022-02-20 22:18:18,091 INFO L87 Difference]: Start difference. First operand 1755 states. Second operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) [2022-02-20 22:18:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:18,267 INFO L93 Difference]: Finished difference Result 1755 states and 2615 transitions. [2022-02-20 22:18:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2615 transitions. [2022-02-20 22:18:18,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:18:18,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:18:18,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) Second operand 1755 states. [2022-02-20 22:18:18,290 INFO L87 Difference]: Start difference. First operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) Second operand 1755 states. [2022-02-20 22:18:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:18,415 INFO L93 Difference]: Finished difference Result 1755 states and 2615 transitions. [2022-02-20 22:18:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2615 transitions. [2022-02-20 22:18:18,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:18:18,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:18:18,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:18:18,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:18:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1019 states have (on average 1.3631010794896958) internal successors, (1389), 1055 states have internal predecessors, (1389), 337 states have call successors, (337), 87 states have call predecessors, (337), 86 states have return successors, (328), 322 states have call predecessors, (328), 328 states have call successors, (328) [2022-02-20 22:18:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2054 transitions. [2022-02-20 22:18:18,537 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2054 transitions. Word has length 84 [2022-02-20 22:18:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:18:18,537 INFO L470 AbstractCegarLoop]: Abstraction has 1443 states and 2054 transitions. [2022-02-20 22:18:18,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2054 transitions. [2022-02-20 22:18:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 22:18:18,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:18:18,541 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 22:18:18,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:18:18,541 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:18:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:18:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 985351915, now seen corresponding path program 1 times [2022-02-20 22:18:18,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:18:18,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200937874] [2022-02-20 22:18:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:18:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:18:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:18:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {11651#true} is VALID [2022-02-20 22:18:18,741 INFO L272 TraceCheckUtils]: 1: Hoare triple {11651#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {11717#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:18,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,742 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {11651#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {11651#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {11651#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11651#true} is VALID [2022-02-20 22:18:18,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,744 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11651#true} {11651#true} #3787#return; {11651#true} is VALID [2022-02-20 22:18:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:18:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {11651#true} is VALID [2022-02-20 22:18:18,782 INFO L272 TraceCheckUtils]: 1: Hoare triple {11651#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {11717#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {11651#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L272 TraceCheckUtils]: 6: Hoare triple {11651#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {11651#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11651#true} is VALID [2022-02-20 22:18:18,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,784 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11651#true} {11651#true} #3789#return; {11651#true} is VALID [2022-02-20 22:18:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:18:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,806 INFO L272 TraceCheckUtils]: 1: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11651#true} {11651#true} #3791#return; {11651#true} is VALID [2022-02-20 22:18:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 22:18:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L272 TraceCheckUtils]: 1: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,824 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11651#true} {11651#true} #3793#return; {11651#true} is VALID [2022-02-20 22:18:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 22:18:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:18,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,851 INFO L272 TraceCheckUtils]: 1: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,851 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,852 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11651#true} {11651#true} #3795#return; {11651#true} is VALID [2022-02-20 22:18:18,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {11651#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(86, 2);call #Ultimate.allocInit(57, 3);call #Ultimate.allocInit(60, 4);call #Ultimate.allocInit(64, 5);call #Ultimate.allocInit(211, 6);call #Ultimate.allocInit(211, 7);call #Ultimate.allocInit(211, 8);call #Ultimate.allocInit(211, 9);call #Ultimate.allocInit(37, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(59, 13);call #Ultimate.allocInit(40, 14);call #Ultimate.allocInit(35, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(37, 17);call #Ultimate.allocInit(37, 18);call #Ultimate.allocInit(67, 19);call #Ultimate.allocInit(33, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(27, 22);call #Ultimate.allocInit(47, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(49, 25);call #Ultimate.allocInit(69, 26);call #Ultimate.allocInit(48, 27);call #Ultimate.allocInit(58, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(65, 30);call #Ultimate.allocInit(48, 31);call #Ultimate.allocInit(63, 32);call #Ultimate.allocInit(65, 33);call #Ultimate.allocInit(41, 34);call #Ultimate.allocInit(56, 35);call #Ultimate.allocInit(52, 36);call #Ultimate.allocInit(103, 37);call #Ultimate.allocInit(70, 38);call #Ultimate.allocInit(51, 39);call #Ultimate.allocInit(38, 40);call #Ultimate.allocInit(38, 41);call #Ultimate.allocInit(55, 42);call #Ultimate.allocInit(49, 43);call #Ultimate.allocInit(62, 44);call #Ultimate.allocInit(48, 45);call #Ultimate.allocInit(69, 46);call #Ultimate.allocInit(48, 47);call #Ultimate.allocInit(41, 48);call #Ultimate.allocInit(58, 49);call #Ultimate.allocInit(55, 50);call #Ultimate.allocInit(55, 51);call #Ultimate.allocInit(40, 52);call #Ultimate.allocInit(72, 53);call #Ultimate.allocInit(57, 54);call #Ultimate.allocInit(54, 55);call #Ultimate.allocInit(48, 56);call #Ultimate.allocInit(46, 57);call #Ultimate.allocInit(82, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(37, 60);call #Ultimate.allocInit(38, 61);call #Ultimate.allocInit(55, 62);call #Ultimate.allocInit(64, 63);call #Ultimate.allocInit(30, 64);call #Ultimate.allocInit(55, 65);call #Ultimate.allocInit(50, 66);call #Ultimate.allocInit(31, 67);call #Ultimate.allocInit(51, 68);call #Ultimate.allocInit(35, 69);call #Ultimate.allocInit(47, 70);call #Ultimate.allocInit(46, 71);call #Ultimate.allocInit(46, 72);call #Ultimate.allocInit(95, 73);call #Ultimate.allocInit(34, 74);call #Ultimate.allocInit(39, 75);call #Ultimate.allocInit(56, 76);call #Ultimate.allocInit(60, 77);call #Ultimate.allocInit(62, 78);call #Ultimate.allocInit(37, 79);call #Ultimate.allocInit(55, 80);call #Ultimate.allocInit(34, 81);call #Ultimate.allocInit(46, 82);call #Ultimate.allocInit(57, 83);call #Ultimate.allocInit(58, 84);call #Ultimate.allocInit(48, 85);call #Ultimate.allocInit(35, 86);call #Ultimate.allocInit(44, 87);call #Ultimate.allocInit(33, 88);call #Ultimate.allocInit(40, 89);call #Ultimate.allocInit(26, 90);call #Ultimate.allocInit(87, 91);call #Ultimate.allocInit(32, 92);call #Ultimate.allocInit(33, 93);call #Ultimate.allocInit(29, 94);call #Ultimate.allocInit(41, 95);call #Ultimate.allocInit(39, 96);call #Ultimate.allocInit(60, 97);call #Ultimate.allocInit(38, 98);call #Ultimate.allocInit(18, 99);call #Ultimate.allocInit(24, 100);call #Ultimate.allocInit(14, 101);call #Ultimate.allocInit(30, 102);call #Ultimate.allocInit(33, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(27, 105);call #Ultimate.allocInit(46, 106);call #Ultimate.allocInit(211, 107);call #Ultimate.allocInit(36, 108);call #Ultimate.allocInit(37, 109);call #Ultimate.allocInit(8, 110);call #Ultimate.allocInit(47, 111);call #Ultimate.allocInit(11, 112);call #Ultimate.allocInit(9, 113);call #Ultimate.allocInit(16, 114);call #Ultimate.allocInit(23, 115);call #Ultimate.allocInit(23, 116);call #Ultimate.allocInit(37, 117);call #Ultimate.allocInit(27, 118);call #Ultimate.allocInit(53, 119);call #Ultimate.allocInit(9, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(48, 122);call #Ultimate.allocInit(9, 123);call #Ultimate.allocInit(58, 124);call #Ultimate.allocInit(9, 125);~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_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_timer_2_0~0 := 0;~msb_driver_group0~0.base, ~msb_driver_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_work_1_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_work_1_2~0 := 0;~ldv_timer_2_3~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~msb_bdops_group0~0.base, ~msb_bdops_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~debug~0 := 0;~cache_flush_timeout~0 := 1000;~verify_writes~0 := 0;~#chs_table~0.base, ~#chs_table~0.offset := 126, 0;call #Ultimate.allocInit(84, 126);call write~init~int(4, ~#chs_table~0.base, ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 8 + ~#chs_table~0.offset, 1);call write~init~int(247, ~#chs_table~0.base, 9 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 11 + ~#chs_table~0.offset, 1);call write~init~int(8, ~#chs_table~0.base, 12 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 20 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 21 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 23 + ~#chs_table~0.offset, 1);call write~init~int(16, ~#chs_table~0.base, 24 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 32 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 33 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 35 + ~#chs_table~0.offset, 1);call write~init~int(32, ~#chs_table~0.base, 36 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 44 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 45 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 47 + ~#chs_table~0.offset, 1);call write~init~int(64, ~#chs_table~0.base, 48 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 56 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 57 + ~#chs_table~0.offset, 2);call write~init~int(8, ~#chs_table~0.base, 59 + ~#chs_table~0.offset, 1);call write~init~int(128, ~#chs_table~0.base, 60 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 68 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 69 + ~#chs_table~0.offset, 2);call write~init~int(16, ~#chs_table~0.base, 71 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 72 + ~#chs_table~0.offset, 8);call write~init~int(0, ~#chs_table~0.base, 80 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 81 + ~#chs_table~0.offset, 2);call write~init~int(0, ~#chs_table~0.base, 83 + ~#chs_table~0.offset, 1);~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset := 127, 0;call #Ultimate.allocInit(104, 127);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 8 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 16 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 20 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 24 + ~#msb_disk_idr~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_idr~0.base, 28 + ~#msb_disk_idr~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_idr~0.base, 32 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_idr~0.base, 36 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 44 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 52 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 60 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(99, 0, ~#msb_disk_idr~0.base, 68 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 76 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 80 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 92 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 96 + ~#msb_disk_idr~0.offset, 8);~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset := 128, 0;call #Ultimate.allocInit(148, 128);call write~init~int(1, ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 4 + ~#msb_disk_lock~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_lock~0.base, 8 + ~#msb_disk_lock~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_lock~0.base, 12 + ~#msb_disk_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_lock~0.base, 16 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 24 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 32 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 40 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(100, 0, ~#msb_disk_lock~0.base, 48 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 56 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 60 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 80 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 88 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 96 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 104 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 112 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 120 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(101, 0, ~#msb_disk_lock~0.base, 128 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 136 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 140 + ~#msb_disk_lock~0.offset, 8);~#msb_bdops~0.base, ~#msb_bdops~0.offset := 129, 0;call #Ultimate.allocInit(104, 129);call write~init~$Pointer$(#funAddr~msb_bd_open.base, #funAddr~msb_bd_open.offset, ~#msb_bdops~0.base, ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_release.base, #funAddr~msb_bd_release.offset, ~#msb_bdops~0.base, 8 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 16 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 24 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 32 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 40 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 48 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 56 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 64 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 72 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_getgeo.base, #funAddr~msb_bd_getgeo.offset, ~#msb_bdops~0.base, 80 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 88 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_bdops~0.base, 96 + ~#msb_bdops~0.offset, 8);~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset := 130, 0;call #Ultimate.allocInit(24, 130);call write~init~int(1, ~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 1 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 2 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 3 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 4 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 5 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 6 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 7 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 8 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 9 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 10 + ~#msb_id_tbl~0.offset, 1);call write~init~int(2, ~#msb_id_tbl~0.base, 11 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 12 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 13 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 14 + ~#msb_id_tbl~0.offset, 1);call write~init~int(3, ~#msb_id_tbl~0.base, 15 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 16 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 17 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 18 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 19 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 20 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 21 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 22 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 23 + ~#msb_id_tbl~0.offset, 1);~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[5 := 0];~#msb_driver~0.base, ~#msb_driver~0.offset := 131, 0;call #Ultimate.allocInit(157, 131);call write~init~$Pointer$(~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, ~#msb_driver~0.base, ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_probe.base, #funAddr~msb_probe.offset, ~#msb_driver~0.base, 8 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_remove.base, #funAddr~msb_remove.offset, ~#msb_driver~0.base, 16 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_suspend.base, #funAddr~msb_suspend.offset, ~#msb_driver~0.base, 24 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_resume.base, #funAddr~msb_resume.offset, ~#msb_driver~0.base, 32 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(120, 0, ~#msb_driver~0.base, 40 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 48 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_driver~0.base, 56 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 64 + ~#msb_driver~0.offset, 8);call write~init~int(0, ~#msb_driver~0.base, 72 + ~#msb_driver~0.offset, 1);call write~init~int(0, ~#msb_driver~0.base, 73 + ~#msb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 77 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 85 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 93 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 101 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 109 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 117 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 125 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 133 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 141 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 149 + ~#msb_driver~0.offset, 8);~major~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_lock_of_memstick_host~0 := 1;~ldv_mutex_msb_disk_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {11651#true} is VALID [2022-02-20 22:18:18,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {11651#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset, main_#t~ret1017#1.base, main_#t~ret1017#1.offset, main_#t~ret1018#1.base, main_#t~ret1018#1.offset, main_#t~ret1019#1.base, main_#t~ret1019#1.offset, main_#t~ret1020#1.base, main_#t~ret1020#1.offset, main_#t~nondet1021#1, main_#t~switch1022#1, main_#t~nondet1023#1, main_#t~switch1024#1, main_#t~mem1025#1, main_#t~ret1026#1, main_#t~ret1027#1, main_#t~mem1028#1, main_#t~ret1029#1, main_#t~nondet1030#1, main_#t~switch1031#1, main_#t~ret1032#1, main_#t~nondet1033#1, main_#t~switch1034#1, main_#t~ret1035#1, main_#t~mem1036#1, main_#t~ret1037#1, main_#t~ret1038#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~63#1.base, main_~tmp~63#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~tmp___1~22#1, main_~tmp___2~14#1, main_~tmp___3~10#1, main_~tmp___4~7#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~63#1.base, main_~tmp~63#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~22#1;havoc main_~tmp___2~14#1;havoc main_~tmp___3~10#1;havoc main_~tmp___4~7#1; {11651#true} is VALID [2022-02-20 22:18:18,853 INFO L272 TraceCheckUtils]: 2: Hoare triple {11651#true} call main_#t~ret1016#1.base, main_#t~ret1016#1.offset := ldv_init_zalloc(16); {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:18,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {11651#true} is VALID [2022-02-20 22:18:18,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {11651#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {11717#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:18,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {11651#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L272 TraceCheckUtils]: 9: Hoare triple {11651#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {11651#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11651#true} is VALID [2022-02-20 22:18:18,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,862 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11651#true} {11651#true} #3787#return; {11651#true} is VALID [2022-02-20 22:18:18,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {11651#true} main_~tmp~63#1.base, main_~tmp~63#1.offset := main_#t~ret1016#1.base, main_#t~ret1016#1.offset;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~63#1.base, main_~tmp~63#1.offset; {11651#true} is VALID [2022-02-20 22:18:18,864 INFO L272 TraceCheckUtils]: 18: Hoare triple {11651#true} call main_#t~ret1017#1.base, main_#t~ret1017#1.offset := ldv_init_zalloc(1744); {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:18,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {11709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L272 TraceCheckUtils]: 20: Hoare triple {11651#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {11717#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {11717#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11651#true} {11651#true} #3375#return; {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {11651#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L272 TraceCheckUtils]: 25: Hoare triple {11651#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {11651#true} ~cond := #in~cond; {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {11651#true} assume !(0 == ~cond); {11651#true} is VALID [2022-02-20 22:18:18,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {11651#true} {11651#true} #3377#return; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {11651#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11651#true} {11651#true} #3789#return; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {11651#true} main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset := main_#t~ret1017#1.base, main_#t~ret1017#1.offset;havoc main_#t~ret1017#1.base, main_#t~ret1017#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;assume { :begin_inline_ldv_initialize } true; {11651#true} is VALID [2022-02-20 22:18:18,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {11651#true} assume { :end_inline_ldv_initialize } true; {11651#true} is VALID [2022-02-20 22:18:18,867 INFO L272 TraceCheckUtils]: 35: Hoare triple {11651#true} call main_#t~ret1018#1.base, main_#t~ret1018#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {11725#(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:18:18,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L272 TraceCheckUtils]: 37: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,868 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11651#true} {11651#true} #3791#return; {11651#true} is VALID [2022-02-20 22:18:18,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {11651#true} havoc main_#t~ret1018#1.base, main_#t~ret1018#1.offset; {11651#true} is VALID [2022-02-20 22:18:18,869 INFO L272 TraceCheckUtils]: 46: Hoare triple {11651#true} call main_#t~ret1019#1.base, main_#t~ret1019#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {11725#(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:18:18,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,870 INFO L272 TraceCheckUtils]: 48: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,870 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,871 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11651#true} {11651#true} #3793#return; {11651#true} is VALID [2022-02-20 22:18:18,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {11651#true} havoc main_#t~ret1019#1.base, main_#t~ret1019#1.offset; {11651#true} is VALID [2022-02-20 22:18:18,871 INFO L272 TraceCheckUtils]: 57: Hoare triple {11651#true} call main_#t~ret1020#1.base, main_#t~ret1020#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 4); {11725#(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:18:18,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,872 INFO L272 TraceCheckUtils]: 59: Hoare triple {11651#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11725#(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:18:18,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {11725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {11651#true} is VALID [2022-02-20 22:18:18,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {11651#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {11651#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11651#true} {11651#true} #3391#return; {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {11651#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {11651#true} assume true; {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11651#true} {11651#true} #3795#return; {11651#true} is VALID [2022-02-20 22:18:18,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {11651#true} havoc main_#t~ret1020#1.base, main_#t~ret1020#1.offset;~ldv_state_variable_4~0 := 0;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; {11708#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 22:18:18,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {11708#(= ~ldv_state_variable_4~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_3~0 := 0;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {11708#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 22:18:18,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {11708#(= ~ldv_state_variable_4~0 0)} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1; {11708#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 22:18:18,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {11708#(= ~ldv_state_variable_4~0 0)} assume -2147483648 <= main_#t~nondet1021#1 && main_#t~nondet1021#1 <= 2147483647;main_~tmp___1~22#1 := main_#t~nondet1021#1;havoc main_#t~nondet1021#1;main_#t~switch1022#1 := 0 == main_~tmp___1~22#1; {11708#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 22:18:18,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {11708#(= ~ldv_state_variable_4~0 0)} assume main_#t~switch1022#1; {11708#(= ~ldv_state_variable_4~0 0)} is VALID [2022-02-20 22:18:18,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {11708#(= ~ldv_state_variable_4~0 0)} assume 0 != ~ldv_state_variable_4~0;assume -2147483648 <= main_#t~nondet1023#1 && main_#t~nondet1023#1 <= 2147483647;main_~tmp___2~14#1 := main_#t~nondet1023#1;havoc main_#t~nondet1023#1;main_#t~switch1024#1 := 0 == main_~tmp___2~14#1; {11652#false} is VALID [2022-02-20 22:18:18,875 INFO L290 TraceCheckUtils]: 73: Hoare triple {11652#false} assume main_#t~switch1024#1; {11652#false} is VALID [2022-02-20 22:18:18,875 INFO L290 TraceCheckUtils]: 74: Hoare triple {11652#false} assume 2 == ~ldv_state_variable_4~0;call main_#t~mem1025#1 := read~int(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 4);assume { :begin_inline_msb_bd_release } true;msb_bd_release_#in~disk#1.base, msb_bd_release_#in~disk#1.offset, msb_bd_release_#in~mode#1 := main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_#t~mem1025#1;havoc msb_bd_release_#t~ret869#1, msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset, msb_bd_release_~mode#1;msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset := msb_bd_release_#in~disk#1.base, msb_bd_release_#in~disk#1.offset;msb_bd_release_~mode#1 := msb_bd_release_#in~mode#1; {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L272 TraceCheckUtils]: 75: Hoare triple {11652#false} call msb_bd_release_#t~ret869#1 := msb_disk_release(msb_bd_release_~disk#1.base, msb_bd_release_~disk#1.offset); {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {11652#false} ~disk#1.base, ~disk#1.offset := #in~disk#1.base, #in~disk#1.offset;havoc ~msb~9#1.base, ~msb~9#1.offset;call #t~mem863#1.base, #t~mem863#1.offset := read~$Pointer$(~disk#1.base, 1569 + ~disk#1.offset, 8);~msb~9#1.base, ~msb~9#1.offset := #t~mem863#1.base, #t~mem863#1.offset;havoc #t~mem863#1.base, #t~mem863#1.offset; {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {11652#false} assume !(~debug~0 > 1); {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {11652#false} assume { :begin_inline_ldv_mutex_lock_21 } true;ldv_mutex_lock_21_#in~ldv_func_arg1#1.base, ldv_mutex_lock_21_#in~ldv_func_arg1#1.offset := ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset;havoc ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset;ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset := ldv_mutex_lock_21_#in~ldv_func_arg1#1.base, ldv_mutex_lock_21_#in~ldv_func_arg1#1.offset; {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L272 TraceCheckUtils]: 79: Hoare triple {11652#false} call ldv_mutex_lock_msb_disk_lock(ldv_mutex_lock_21_~ldv_func_arg1#1.base, ldv_mutex_lock_21_~ldv_func_arg1#1.offset); {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {11652#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {11652#false} is VALID [2022-02-20 22:18:18,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {11652#false} assume 1 != ~ldv_mutex_msb_disk_lock~0; {11652#false} is VALID [2022-02-20 22:18:18,877 INFO L272 TraceCheckUtils]: 82: Hoare triple {11652#false} call ldv_error(); {11652#false} is VALID [2022-02-20 22:18:18,877 INFO L290 TraceCheckUtils]: 83: Hoare triple {11652#false} assume !false; {11652#false} is VALID [2022-02-20 22:18:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 22:18:18,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:18:18,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200937874] [2022-02-20 22:18:18,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200937874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:18:18,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:18:18,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:18:18,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50723141] [2022-02-20 22:18:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:18:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2022-02-20 22:18:18,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:18:18,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:18:18,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:18:18,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:18:18,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:18:18,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:18:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:18:18,955 INFO L87 Difference]: Start difference. First operand 1443 states and 2054 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:18:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:49,173 INFO L93 Difference]: Finished difference Result 4875 states and 7174 transitions. [2022-02-20 22:18:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:18:49,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 84 [2022-02-20 22:18:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:18:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:18:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7174 transitions. [2022-02-20 22:18:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:18:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7174 transitions. [2022-02-20 22:18:49,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 7174 transitions. [2022-02-20 22:18:55,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7174 edges. 7174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:18:55,981 INFO L225 Difference]: With dead ends: 4875 [2022-02-20 22:18:55,981 INFO L226 Difference]: Without dead ends: 3452 [2022-02-20 22:18:56,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 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:18:56,017 INFO L933 BasicCegarLoop]: 2261 mSDtfsCounter, 3730 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 3837 mSolverCounterSat, 2173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3990 SdHoareTripleChecker+Valid, 6433 SdHoareTripleChecker+Invalid, 6010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2173 IncrementalHoareTripleChecker+Valid, 3837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-02-20 22:18:56,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3990 Valid, 6433 Invalid, 6010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2173 Valid, 3837 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-02-20 22:18:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2022-02-20 22:18:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 2809. [2022-02-20 22:18:56,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:18:56,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3452 states. Second operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) [2022-02-20 22:18:56,250 INFO L74 IsIncluded]: Start isIncluded. First operand 3452 states. Second operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) [2022-02-20 22:18:56,274 INFO L87 Difference]: Start difference. First operand 3452 states. Second operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) [2022-02-20 22:18:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:56,691 INFO L93 Difference]: Finished difference Result 3452 states and 5144 transitions. [2022-02-20 22:18:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5144 transitions. [2022-02-20 22:18:56,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:18:56,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:18:56,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) Second operand 3452 states. [2022-02-20 22:18:56,716 INFO L87 Difference]: Start difference. First operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) Second operand 3452 states. [2022-02-20 22:18:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:18:57,103 INFO L93 Difference]: Finished difference Result 3452 states and 5144 transitions. [2022-02-20 22:18:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5144 transitions. [2022-02-20 22:18:57,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:18:57,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:18:57,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:18:57,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:18:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 1987 states have (on average 1.3643683945646703) internal successors, (2711), 2053 states have internal predecessors, (2711), 651 states have call successors, (651), 171 states have call predecessors, (651), 170 states have return successors, (642), 628 states have call predecessors, (642), 642 states have call successors, (642) [2022-02-20 22:18:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 4004 transitions. [2022-02-20 22:18:57,504 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 4004 transitions. Word has length 84 [2022-02-20 22:18:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:18:57,505 INFO L470 AbstractCegarLoop]: Abstraction has 2809 states and 4004 transitions. [2022-02-20 22:18:57,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:18:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 4004 transitions. [2022-02-20 22:18:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 22:18:57,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:18:57,507 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 22:18:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:18:57,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:18:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:18:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1154429741, now seen corresponding path program 1 times [2022-02-20 22:18:57,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:18:57,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653251238] [2022-02-20 22:18:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:18:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:18:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:18:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {29383#true} is VALID [2022-02-20 22:18:57,637 INFO L272 TraceCheckUtils]: 1: Hoare triple {29383#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {29449#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:57,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {29383#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {29383#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {29383#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {29383#true} is VALID [2022-02-20 22:18:57,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,639 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3787#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:18:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:18:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {29383#true} is VALID [2022-02-20 22:18:57,679 INFO L272 TraceCheckUtils]: 1: Hoare triple {29383#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {29449#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:57,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {29383#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {29383#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {29383#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {29383#true} is VALID [2022-02-20 22:18:57,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,681 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3789#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:18:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,710 INFO L272 TraceCheckUtils]: 1: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,712 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,719 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3791#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 22:18:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,734 INFO L272 TraceCheckUtils]: 1: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,735 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,736 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3793#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 22:18:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:18:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:18:57,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L272 TraceCheckUtils]: 1: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,761 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3795#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {29383#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(86, 2);call #Ultimate.allocInit(57, 3);call #Ultimate.allocInit(60, 4);call #Ultimate.allocInit(64, 5);call #Ultimate.allocInit(211, 6);call #Ultimate.allocInit(211, 7);call #Ultimate.allocInit(211, 8);call #Ultimate.allocInit(211, 9);call #Ultimate.allocInit(37, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(59, 13);call #Ultimate.allocInit(40, 14);call #Ultimate.allocInit(35, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(37, 17);call #Ultimate.allocInit(37, 18);call #Ultimate.allocInit(67, 19);call #Ultimate.allocInit(33, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(27, 22);call #Ultimate.allocInit(47, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(49, 25);call #Ultimate.allocInit(69, 26);call #Ultimate.allocInit(48, 27);call #Ultimate.allocInit(58, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(65, 30);call #Ultimate.allocInit(48, 31);call #Ultimate.allocInit(63, 32);call #Ultimate.allocInit(65, 33);call #Ultimate.allocInit(41, 34);call #Ultimate.allocInit(56, 35);call #Ultimate.allocInit(52, 36);call #Ultimate.allocInit(103, 37);call #Ultimate.allocInit(70, 38);call #Ultimate.allocInit(51, 39);call #Ultimate.allocInit(38, 40);call #Ultimate.allocInit(38, 41);call #Ultimate.allocInit(55, 42);call #Ultimate.allocInit(49, 43);call #Ultimate.allocInit(62, 44);call #Ultimate.allocInit(48, 45);call #Ultimate.allocInit(69, 46);call #Ultimate.allocInit(48, 47);call #Ultimate.allocInit(41, 48);call #Ultimate.allocInit(58, 49);call #Ultimate.allocInit(55, 50);call #Ultimate.allocInit(55, 51);call #Ultimate.allocInit(40, 52);call #Ultimate.allocInit(72, 53);call #Ultimate.allocInit(57, 54);call #Ultimate.allocInit(54, 55);call #Ultimate.allocInit(48, 56);call #Ultimate.allocInit(46, 57);call #Ultimate.allocInit(82, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(37, 60);call #Ultimate.allocInit(38, 61);call #Ultimate.allocInit(55, 62);call #Ultimate.allocInit(64, 63);call #Ultimate.allocInit(30, 64);call #Ultimate.allocInit(55, 65);call #Ultimate.allocInit(50, 66);call #Ultimate.allocInit(31, 67);call #Ultimate.allocInit(51, 68);call #Ultimate.allocInit(35, 69);call #Ultimate.allocInit(47, 70);call #Ultimate.allocInit(46, 71);call #Ultimate.allocInit(46, 72);call #Ultimate.allocInit(95, 73);call #Ultimate.allocInit(34, 74);call #Ultimate.allocInit(39, 75);call #Ultimate.allocInit(56, 76);call #Ultimate.allocInit(60, 77);call #Ultimate.allocInit(62, 78);call #Ultimate.allocInit(37, 79);call #Ultimate.allocInit(55, 80);call #Ultimate.allocInit(34, 81);call #Ultimate.allocInit(46, 82);call #Ultimate.allocInit(57, 83);call #Ultimate.allocInit(58, 84);call #Ultimate.allocInit(48, 85);call #Ultimate.allocInit(35, 86);call #Ultimate.allocInit(44, 87);call #Ultimate.allocInit(33, 88);call #Ultimate.allocInit(40, 89);call #Ultimate.allocInit(26, 90);call #Ultimate.allocInit(87, 91);call #Ultimate.allocInit(32, 92);call #Ultimate.allocInit(33, 93);call #Ultimate.allocInit(29, 94);call #Ultimate.allocInit(41, 95);call #Ultimate.allocInit(39, 96);call #Ultimate.allocInit(60, 97);call #Ultimate.allocInit(38, 98);call #Ultimate.allocInit(18, 99);call #Ultimate.allocInit(24, 100);call #Ultimate.allocInit(14, 101);call #Ultimate.allocInit(30, 102);call #Ultimate.allocInit(33, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(27, 105);call #Ultimate.allocInit(46, 106);call #Ultimate.allocInit(211, 107);call #Ultimate.allocInit(36, 108);call #Ultimate.allocInit(37, 109);call #Ultimate.allocInit(8, 110);call #Ultimate.allocInit(47, 111);call #Ultimate.allocInit(11, 112);call #Ultimate.allocInit(9, 113);call #Ultimate.allocInit(16, 114);call #Ultimate.allocInit(23, 115);call #Ultimate.allocInit(23, 116);call #Ultimate.allocInit(37, 117);call #Ultimate.allocInit(27, 118);call #Ultimate.allocInit(53, 119);call #Ultimate.allocInit(9, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(48, 122);call #Ultimate.allocInit(9, 123);call #Ultimate.allocInit(58, 124);call #Ultimate.allocInit(9, 125);~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_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_timer_2_0~0 := 0;~msb_driver_group0~0.base, ~msb_driver_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_work_1_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_work_1_2~0 := 0;~ldv_timer_2_3~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~msb_bdops_group0~0.base, ~msb_bdops_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~debug~0 := 0;~cache_flush_timeout~0 := 1000;~verify_writes~0 := 0;~#chs_table~0.base, ~#chs_table~0.offset := 126, 0;call #Ultimate.allocInit(84, 126);call write~init~int(4, ~#chs_table~0.base, ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 8 + ~#chs_table~0.offset, 1);call write~init~int(247, ~#chs_table~0.base, 9 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 11 + ~#chs_table~0.offset, 1);call write~init~int(8, ~#chs_table~0.base, 12 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 20 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 21 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 23 + ~#chs_table~0.offset, 1);call write~init~int(16, ~#chs_table~0.base, 24 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 32 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 33 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 35 + ~#chs_table~0.offset, 1);call write~init~int(32, ~#chs_table~0.base, 36 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 44 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 45 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 47 + ~#chs_table~0.offset, 1);call write~init~int(64, ~#chs_table~0.base, 48 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 56 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 57 + ~#chs_table~0.offset, 2);call write~init~int(8, ~#chs_table~0.base, 59 + ~#chs_table~0.offset, 1);call write~init~int(128, ~#chs_table~0.base, 60 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 68 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 69 + ~#chs_table~0.offset, 2);call write~init~int(16, ~#chs_table~0.base, 71 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 72 + ~#chs_table~0.offset, 8);call write~init~int(0, ~#chs_table~0.base, 80 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 81 + ~#chs_table~0.offset, 2);call write~init~int(0, ~#chs_table~0.base, 83 + ~#chs_table~0.offset, 1);~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset := 127, 0;call #Ultimate.allocInit(104, 127);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 8 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 16 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 20 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 24 + ~#msb_disk_idr~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_idr~0.base, 28 + ~#msb_disk_idr~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_idr~0.base, 32 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_idr~0.base, 36 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 44 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 52 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 60 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(99, 0, ~#msb_disk_idr~0.base, 68 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 76 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 80 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 92 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 96 + ~#msb_disk_idr~0.offset, 8);~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset := 128, 0;call #Ultimate.allocInit(148, 128);call write~init~int(1, ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 4 + ~#msb_disk_lock~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_lock~0.base, 8 + ~#msb_disk_lock~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_lock~0.base, 12 + ~#msb_disk_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_lock~0.base, 16 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 24 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 32 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 40 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(100, 0, ~#msb_disk_lock~0.base, 48 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 56 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 60 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 80 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 88 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 96 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 104 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 112 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 120 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(101, 0, ~#msb_disk_lock~0.base, 128 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 136 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 140 + ~#msb_disk_lock~0.offset, 8);~#msb_bdops~0.base, ~#msb_bdops~0.offset := 129, 0;call #Ultimate.allocInit(104, 129);call write~init~$Pointer$(#funAddr~msb_bd_open.base, #funAddr~msb_bd_open.offset, ~#msb_bdops~0.base, ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_release.base, #funAddr~msb_bd_release.offset, ~#msb_bdops~0.base, 8 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 16 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 24 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 32 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 40 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 48 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 56 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 64 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 72 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_getgeo.base, #funAddr~msb_bd_getgeo.offset, ~#msb_bdops~0.base, 80 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 88 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_bdops~0.base, 96 + ~#msb_bdops~0.offset, 8);~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset := 130, 0;call #Ultimate.allocInit(24, 130);call write~init~int(1, ~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 1 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 2 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 3 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 4 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 5 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 6 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 7 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 8 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 9 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 10 + ~#msb_id_tbl~0.offset, 1);call write~init~int(2, ~#msb_id_tbl~0.base, 11 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 12 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 13 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 14 + ~#msb_id_tbl~0.offset, 1);call write~init~int(3, ~#msb_id_tbl~0.base, 15 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 16 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 17 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 18 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 19 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 20 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 21 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 22 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 23 + ~#msb_id_tbl~0.offset, 1);~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[5 := 0];~#msb_driver~0.base, ~#msb_driver~0.offset := 131, 0;call #Ultimate.allocInit(157, 131);call write~init~$Pointer$(~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, ~#msb_driver~0.base, ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_probe.base, #funAddr~msb_probe.offset, ~#msb_driver~0.base, 8 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_remove.base, #funAddr~msb_remove.offset, ~#msb_driver~0.base, 16 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_suspend.base, #funAddr~msb_suspend.offset, ~#msb_driver~0.base, 24 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_resume.base, #funAddr~msb_resume.offset, ~#msb_driver~0.base, 32 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(120, 0, ~#msb_driver~0.base, 40 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 48 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_driver~0.base, 56 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 64 + ~#msb_driver~0.offset, 8);call write~init~int(0, ~#msb_driver~0.base, 72 + ~#msb_driver~0.offset, 1);call write~init~int(0, ~#msb_driver~0.base, 73 + ~#msb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 77 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 85 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 93 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 101 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 109 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 117 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 125 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 133 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 141 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 149 + ~#msb_driver~0.offset, 8);~major~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~ldv_mutex_i_mutex_of_inode~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_lock_of_memstick_host~0 := 1;~ldv_mutex_msb_disk_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset, main_#t~ret1017#1.base, main_#t~ret1017#1.offset, main_#t~ret1018#1.base, main_#t~ret1018#1.offset, main_#t~ret1019#1.base, main_#t~ret1019#1.offset, main_#t~ret1020#1.base, main_#t~ret1020#1.offset, main_#t~nondet1021#1, main_#t~switch1022#1, main_#t~nondet1023#1, main_#t~switch1024#1, main_#t~mem1025#1, main_#t~ret1026#1, main_#t~ret1027#1, main_#t~mem1028#1, main_#t~ret1029#1, main_#t~nondet1030#1, main_#t~switch1031#1, main_#t~ret1032#1, main_#t~nondet1033#1, main_#t~switch1034#1, main_#t~ret1035#1, main_#t~mem1036#1, main_#t~ret1037#1, main_#t~ret1038#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~63#1.base, main_~tmp~63#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~tmp___1~22#1, main_~tmp___2~14#1, main_~tmp___3~10#1, main_~tmp___4~7#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~63#1.base, main_~tmp~63#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~22#1;havoc main_~tmp___2~14#1;havoc main_~tmp___3~10#1;havoc main_~tmp___4~7#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,763 INFO L272 TraceCheckUtils]: 2: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret1016#1.base, main_#t~ret1016#1.offset := ldv_init_zalloc(16); {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:57,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {29383#true} is VALID [2022-02-20 22:18:57,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {29383#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {29449#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:57,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {29383#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L272 TraceCheckUtils]: 9: Hoare triple {29383#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {29383#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {29383#true} is VALID [2022-02-20 22:18:57,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,765 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3787#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp~63#1.base, main_~tmp~63#1.offset := main_#t~ret1016#1.base, main_#t~ret1016#1.offset;havoc main_#t~ret1016#1.base, main_#t~ret1016#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~63#1.base, main_~tmp~63#1.offset; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,766 INFO L272 TraceCheckUtils]: 18: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret1017#1.base, main_#t~ret1017#1.offset := ldv_init_zalloc(1744); {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:18:57,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {29441#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc40.base, #t~malloc40.offset := #Ultimate.allocOnHeap(~size); {29383#true} is VALID [2022-02-20 22:18:57,767 INFO L272 TraceCheckUtils]: 20: Hoare triple {29383#true} call #Ultimate.meminit(#t~malloc40.base, #t~malloc40.offset, 1, ~size, ~size); {29449#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:18:57,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {29449#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {29383#true} is VALID [2022-02-20 22:18:57,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29383#true} {29383#true} #3375#return; {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {29383#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc40.base, #t~malloc40.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L272 TraceCheckUtils]: 25: Hoare triple {29383#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {29383#true} ~cond := #in~cond; {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {29383#true} assume !(0 == ~cond); {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,768 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {29383#true} {29383#true} #3377#return; {29383#true} is VALID [2022-02-20 22:18:57,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {29383#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {29383#true} is VALID [2022-02-20 22:18:57,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,769 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3789#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset := main_#t~ret1017#1.base, main_#t~ret1017#1.offset;havoc main_#t~ret1017#1.base, main_#t~ret1017#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~39#1.base, main_~tmp___0~39#1.offset;assume { :begin_inline_ldv_initialize } true; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_ldv_initialize } true; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,770 INFO L272 TraceCheckUtils]: 35: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret1018#1.base, main_#t~ret1018#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {29457#(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:18:57,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,771 INFO L272 TraceCheckUtils]: 37: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,771 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,772 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3791#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} havoc main_#t~ret1018#1.base, main_#t~ret1018#1.offset; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,773 INFO L272 TraceCheckUtils]: 46: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret1019#1.base, main_#t~ret1019#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {29457#(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:18:57,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L272 TraceCheckUtils]: 48: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,775 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3793#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} havoc main_#t~ret1019#1.base, main_#t~ret1019#1.offset; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,776 INFO L272 TraceCheckUtils]: 57: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} call main_#t~ret1020#1.base, main_#t~ret1020#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 4); {29457#(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:18:57,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L272 TraceCheckUtils]: 59: Hoare triple {29383#true} call #t~memset~res41.base, #t~memset~res41.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {29457#(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:18:57,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {29457#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1116 := 0; {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {29383#true} assume !(#t~loopctr1116 % 18446744073709551616 < #amount % 18446744073709551616); {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {29383#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29383#true} {29383#true} #3391#return; {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {29383#true} ~tmp~7.base, ~tmp~7.offset := ~s.base, ~s.offset;havoc #t~memset~res41.base, #t~memset~res41.offset;#res.base, #res.offset := ~tmp~7.base, ~tmp~7.offset; {29383#true} is VALID [2022-02-20 22:18:57,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {29383#true} assume true; {29383#true} is VALID [2022-02-20 22:18:57,778 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29383#true} {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} #3795#return; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} havoc main_#t~ret1020#1.base, main_#t~ret1020#1.offset;~ldv_state_variable_4~0 := 0;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; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} 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_3~0 := 0;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume -2147483648 <= main_#t~nondet1021#1 && main_#t~nondet1021#1 <= 2147483647;main_~tmp___1~22#1 := main_#t~nondet1021#1;havoc main_#t~nondet1021#1;main_#t~switch1022#1 := 0 == main_~tmp___1~22#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch1022#1;main_#t~switch1022#1 := main_#t~switch1022#1 || 1 == main_~tmp___1~22#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch1022#1;main_#t~switch1022#1 := main_#t~switch1022#1 || 2 == main_~tmp___1~22#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume main_#t~switch1022#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet1030#1 && main_#t~nondet1030#1 <= 2147483647;main_~tmp___3~10#1 := main_#t~nondet1030#1;havoc main_#t~nondet1030#1;main_#t~switch1031#1 := 0 == main_~tmp___3~10#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !main_#t~switch1031#1;main_#t~switch1031#1 := main_#t~switch1031#1 || 1 == main_~tmp___3~10#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume main_#t~switch1031#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_msb_init } true;havoc msb_init_#res#1;havoc msb_init_#t~ret1005#1, msb_init_#t~nondet1006#1, msb_init_#t~ret1007#1, msb_init_#t~nondet1008#1, msb_init_~rc~2#1, msb_init_~tmp~58#1;havoc msb_init_~rc~2#1;havoc msb_init_~tmp~58#1;assume { :begin_inline_register_blkdev } true;register_blkdev_#in~arg0#1, register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset := 0, 121, 0;havoc register_blkdev_#res#1;havoc register_blkdev_#t~nondet1108#1, register_blkdev_~arg0#1, register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset;register_blkdev_~arg0#1 := register_blkdev_#in~arg0#1;register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset := register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset;assume -2147483648 <= register_blkdev_#t~nondet1108#1 && register_blkdev_#t~nondet1108#1 <= 2147483647;register_blkdev_#res#1 := register_blkdev_#t~nondet1108#1;havoc register_blkdev_#t~nondet1108#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} msb_init_#t~ret1005#1 := register_blkdev_#res#1;assume { :end_inline_register_blkdev } true;assume -2147483648 <= msb_init_#t~ret1005#1 && msb_init_#t~ret1005#1 <= 2147483647;msb_init_~tmp~58#1 := msb_init_#t~ret1005#1;havoc msb_init_#t~ret1005#1;msb_init_~rc~2#1 := msb_init_~tmp~58#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,781 INFO L290 TraceCheckUtils]: 79: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume msb_init_~rc~2#1 < 0;havoc msb_init_#t~nondet1006#1;msb_init_#res#1 := msb_init_~rc~2#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} main_#t~ret1032#1 := msb_init_#res#1;assume { :end_inline_msb_init } true;assume -2147483648 <= main_#t~ret1032#1 && main_#t~ret1032#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret1032#1;havoc main_#t~ret1032#1; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume !(0 == ~ldv_retval_1~0); {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,783 INFO L290 TraceCheckUtils]: 83: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume { :begin_inline_ldv_check_final_state } true; {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} is VALID [2022-02-20 22:18:57,783 INFO L290 TraceCheckUtils]: 84: Hoare triple {29385#(= ~ldv_mutex_i_mutex_of_inode~0 1)} assume 1 != ~ldv_mutex_i_mutex_of_inode~0; {29384#false} is VALID [2022-02-20 22:18:57,783 INFO L272 TraceCheckUtils]: 85: Hoare triple {29384#false} call ldv_error(); {29384#false} is VALID [2022-02-20 22:18:57,783 INFO L290 TraceCheckUtils]: 86: Hoare triple {29384#false} assume !false; {29384#false} is VALID [2022-02-20 22:18:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 22:18:57,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:18:57,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653251238] [2022-02-20 22:18:57,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653251238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:18:57,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:18:57,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:18:57,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546457667] [2022-02-20 22:18:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:18:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-02-20 22:18:57,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:18:57,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:18:57,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:18:57,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:18:57,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:18:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:18:57,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:18:57,842 INFO L87 Difference]: Start difference. First operand 2809 states and 4004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)